A Method for the Simultaneous Alignment of Three or More Amino Acid Sequences
Overview
Authors
Affiliations
We describe an algorithm for the concurrent comparison of three or more amino acid sequences. The basis of the approach is a progressive evaluation of selected segments from each sequence. Only a small subset of all possible segments from each sequence is compared, and a minimum of information is retained for the trace-back of the alignment. As a result, this method has the advantage of being both rapid and minimally consumptive of computer memory when constructing an alignment. This being the case, there are no practical limits on the length of sequences that may be aligned. A computer program for the alignment of three sequences is described, and this method is compared with two three-sequence extensions of the Needleman and Wunsch variety, including a recently published approach. In addition, we have made simultaneous alignments of sets of four and five sequences with this selected-segment method.
Yeo H, Yuan Q, Beck M, Baron C, Waksman G Proc Natl Acad Sci U S A. 2003; 100(26):15947-52.
PMID: 14673074 PMC: 307673. DOI: 10.1073/pnas.2535211100.
Multiple DNA and protein sequence alignment based on segment-to-segment comparison.
Morgenstern B, Dress A, Werner T Proc Natl Acad Sci U S A. 1996; 93(22):12098-103.
PMID: 8901539 PMC: 37949. DOI: 10.1073/pnas.93.22.12098.
Discovering active motifs in sets of related protein sequences and using them for classification.
Wang J, Marr T, Shasha D, Shapiro B, Chirn G Nucleic Acids Res. 1994; 22(14):2769-75.
PMID: 8052532 PMC: 308246. DOI: 10.1093/nar/22.14.2769.
Efficient methods for multiple sequence alignment with guaranteed error bounds.
Gusfield D Bull Math Biol. 1993; 55(1):141-54.
PMID: 7680269 DOI: 10.1007/BF02460299.
A multiple sequence comparison method.
Wong A, Chan S, Chiu D Bull Math Biol. 1993; 55(2):465-86.
PMID: 7679304 DOI: 10.1007/BF02460892.