An algorithm for progressive multiple alignment of sequences with insertions.
Dynamic programming algorithms guarantee to find the optimal alignment between two sequences. For more than a few sequences, exact algorithms become computationally impractical, and progressive algorithms iterating pairwise alignments are widely used. These heuristic methods have a serious drawback because pairwise algorithms do not differentiate insertions from deletions and end up penalizing single insertion events multiple times. Such an unrealistically high penalty for insertions typically results in overmatching of sequences and an underestimation of the number of insertion events. We describe a modification of the traditional alignment algorithm that can distinguish insertion from deletion and avoid repeated penalization of insertions and illustrate this method with a pair hidden Markov model that uses an evolutionary scoring function. In comparison with a traditional progressive alignment method, our algorithm infers a greater number of insertion events and creates gaps that are phylogenetically consistent but spatially less concentrated. Our results suggest that some insertion/deletion "hot spots" may actually be artifacts of traditional alignment algorithms.
European Molecular Biology Laboratory-European Bioinformatics Institute, Hinxton CB10 1SD, United Kingdom. ari@ebi.ac.uk
Ari
A
Löytynoja
Nick
N
Goldman
D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D019143:Evolution, Molecular; D008390:Markov Chains; D008957:Models, Genetic; D010802:Phylogeny; D016415:Sequence Alignment / Q000379:methods*; D012689:Sequence Homology, Nucleic Acid