Bioinformatics Advance Access originally published online on February 10, 2006
Bioinformatics 2006 22(9):1080-1087; doi:10.1093/bioinformatics/btl046
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Development and validation of a consistency based multiple structure alignment algorithm
Program in Biophysics and Department of Biochemistry, Stanford University Stanford, CA 94305 USA
*To whom correspondence should be addressed
Summary: We introduce an algorithm that uses the information gained from simultaneous consideration of an entire group of related proteins to create multiple structure alignments (MSTAs). Consistency-based alignment (CBA) first harnesses the information contained within regions that are consistently aligned among a set of pairwise superpositions in order to realign pairs of proteins through both global and local refinement methods. It then constructs a multiple alignment that is maximally consistent with the improved pairwise alignments. We validate CBA's alignments by assessing their accuracy in regions where at least two of the aligned structures contain the same conserved sequence motif.
Results: CBA correctly aligns well over 90% of motif residues in superpositions of proteins belonging to the same family or superfamily, and it outperforms a number of previously reported MSTA algorithms.
Availability: CBA is available at http://cba.stanford.edu/ and the source code is freely available at http://brutlag.stanford.edu/software/
Contact: brutlag{at}stanford.edu
Supplementary information: Supplementary data are available at Bioinformatics online.
Received on November 8, 2005; revised on December 20, 2005; accepted on February 6, 2006
This article has been cited by other articles:
![]() |
Y. Chen and G. M. Crippen An iterative refinement algorithm for consistency based multiple structural alignment methods Bioinformatics, September 1, 2006; 22(17): 2087 - 2093. [Abstract] [Full Text] [PDF] |
||||
