Simplifying amino acid alphabets by means of a branch and bound algorithm and substitution matrices

Bioinformatics

Volumn 18, Issue 8, 2002, Pages 1102-1108

  Cannata, Nicola ^a   Toppo, Stefano ^a   Romualdi, Chiara ^a   Valle, Giorgio ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AMINO ACID;

ALGORITHM; AMINO ACID SEQUENCE; ANALYTIC METHOD; ARTICLE; BIOINFORMATICS; COMPUTER PROGRAM; CONTROLLED STUDY; DNA SEQUENCE; MATHEMATICAL COMPUTING; METHODOLOGY; PRIORITY JOURNAL; PROTEIN ANALYSIS; PROTEIN FOLDING; SCORING SYSTEM; SEQUENCE ANALYSIS;

EID: 0036677673     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/18.8.1102     Document Type: Article

References (12)

1. Set partitioning: A survey
2. Approaches to the automatic discovery of patterns in biosequences
3. Theory for the folding and stability of globular proteins
4. Amino acid substitution matrices from protein blocks
5. Protein design by binary patterning of polar and nonpolar amino acids
6. Multiple-alphabet amino acid sequence comparison of the Ig-kappa chain constant domain
7. Simplified amino acid alphabets for protein fold recognition and implications for folding
8. Functional rapidly folding proteins from simplified amino acid sequences
9. Multiple sequence comparisons - A peptide matching approach
10. Method to determine the reading frame of a protein from the purine/pyrimidine genome sequence and its possible evolutionary justification
11. Matrices for detecting distant relationships
12. A computational approach to simplifying the protein folding alphabet