A fast and sensitive multiple sequence alignment algorithm
- 1 April 1989
- journal article
- research article
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 5 (2), 115-121
- https://doi.org/10.1093/bioinformatics/5.2.115
Abstract
A two-step multiple alignment strategy is presented that allows rapid alignment of a set of homologous sequences and comparison of pre-aligned groups of sequences. Examples are given demonstrating the improvement in the quality of alignments when comparing entire groups instead of single sequences. The modular design of computer programs based on this algorithm allows for storage of aligned sequences and successive alignment of any number of sequences.This publication has 11 references indexed in Scilit:
- Efficient algorithms for molecular sequence analysis.Proceedings of the National Academy of Sciences, 1988
- A flexible multiple sequence alignment programNucleic Acids Research, 1988
- A strategy for the rapid multiple alignment of protein sequencesJournal of Molecular Biology, 1987
- Progressive sequence alignment as a prerequisitetto correct phylogenetic treesJournal of Molecular Evolution, 1987
- Profile analysis: detection of distantly related proteins.Proceedings of the National Academy of Sciences, 1987
- Multiple sequence alignment by a pairwise algorithmBioinformatics, 1987
- A multiple alignment program for protein sequencesBioinformatics, 1987
- Evaluation and improvements in the automatic alignment of protein sequencesProtein Engineering, Design and Selection, 1987
- Simultaneous comparison of three protein sequences.Proceedings of the National Academy of Sciences, 1985
- General methods of sequence comparisonBulletin of Mathematical Biology, 1984