Multiple sequence alignment by a pairwise algorithm
Laboratory of Molecular Biology, Dept. of Crystallography, Birkbeck College London WC1E 7HX, UK
An algorithm is described that processes the results of a conventional pairwise sequence alignment program to automatically produce an unambiguous multiple alignment of many sequences. Unlike other, more complex, multiple alignment programs, the method described here is fast enough to be used on almost any multiple sequence alignment problem.
Received on September 25, 1986; accepted on January 29, 1987
This article has been cited by other articles:
![]() |
I. Sillitoe, M. Dibley, J. Bray, S. Addou, and C. Orengo Assessing strategies for improved superfamily recognition Protein Sci., July 1, 2005; 14(7): 1800 - 1810. [Abstract] [Full Text] [PDF] |
||||
![]() |
I. M. Wallace, O. Orla, and D. G. Higgins Evaluation of iterative alignment algorithms for multiple alignment Bioinformatics, April 15, 2005; 21(8): 1408 - 1414. [Abstract] [Full Text] [PDF] |
||||
![]() |
C. L. Lu and Y. P. Huang A memory-efficient algorithm for multiple sequence alignment with constraints Bioinformatics, January 1, 2005; 21(1): 20 - 30. [Abstract] [Full Text] [PDF] |
||||
![]() |
G. Gonnet, M. Cohen, and S. Benner Exhaustive matching of the entire protein sequence database Science, June 5, 1992; 256(5062): 1443 - 1445. [Abstract] [PDF] |
||||


