A tool for multiple sequence alignment.
David J. Lipman, Stephen F. Altschul, John D. Kececioglu · Proceedings of the National Academy of Sciences · 1989
Multiple sequence alignment can be a useful technique for studying molecular evolution and analyzing sequence-structure relationships. Until recently, it has been impractical to apply dynamic programming, the most widely accepted method for producing pairwise alignments, to comparisons of more than three sequences. We describe the design and application of a tool for multiple alignment of amino acid sequences that implements a new algorithm that greatly reduces the computational demands of dynamic programming. This tool is able to align in reasonable time as many as eight sequences the length of an average protein.
Cited by 506 works. doi:10.1073/pnas.86.12.4412
Authors
References
- The neighbor-joining method: a new method for reconstructing phylogenetic trees.
- A general method applicable to the search for similarities in the amino acid sequence of two proteins
- Rapid and Sensitive Protein Similarity Searches
- Rapid similarity searches of nucleic acid and protein data banks.
- Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison
- Atlas of Protein Sequence and Structure, 1966.
- Progressive sequence alignment as a prerequisitetto correct phylogenetic trees
- An improved algorithm for matching biological sequences
- Optimal alignments in linear space
- Determinants of a protein fold