Local multiple alignment by consensus matrix
Chemistry Department, Faculty of Science, Kyoto University Kyoto 606, Japan
A new algorithm for aligning several sequences based on the calculation of a consensus matrix and the comparison of all the sequences using this consensus matrix is described. This consensus matrix contains the preference scores of each nucleotideøamino acid and gaps in every position of the alignment. Two modifications of the algorithm corresponding to the evolutionary and functional meanings of the alignment were developed. The first one solves the best-fitting problem without any penalty for end gaps and with an internal gap penalty function independent on the gap length. This algorithm should be used when comparing evolutionary-related proteins for identifying the most conservative residues. The other modification of the algorithm finds the most similar segments in the given sequences. It can be used for finding those parts of the sequences that are responsible for the same biological Junction. In this case the gap penalty function was chosen to be proportional to the gap length. The result of aligning amino acid sequences of neutral proteases and a compilation of 65 allosteric effectors and substrates of PEP carboxylase are presented.
Received on August 15, 1991; accepted on December 30, 1991
CiteULike 
Connotea 
Del.icio.us What's this?
This article has been cited by other articles:
|
|
 |
|
  C. Lawrence, S. Altschul, M. Boguski, J. Liu, A. Neuwald, and J. Wootton Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment Science, October 8, 1993; 262(5131): 208 - 214. [Abstract] [PDF]
|
|