A comprehensive comparison of multiple sequence alignment programs

Citations Over TimeTop 10% of 1999 papers

Abstract

In recent years improvements to existing programs and the introduction of new iterative algorithms have changed the state-of-the-art in protein sequence alignment. This paper presents the first systematic study of the most commonly used alignment programs using BAliBASE benchmark alignments as test cases. Even below the 'twilight zone' at 10-20% residue identity, the best programs were capable of correctly aligning on average 47% of the residues. We show that iterative algorithms often offer improved alignment accuracy though at the expense of computation time. A notable exception was the effect of introducing a single divergent sequence into a set of closely related sequences, causing the iteration to diverge away from the best alignment. Global alignment programs generally performed better than local methods, except in the presence of large N/C-terminal extensions and internal insertions. In these cases, a local algorithm was more successful in identifying the most conserved motifs. This study enables us to propose appropriate alignment strategies, depending on the nature of a particular set of sequences. The employment of more than one program based on different alignment techniques should significantly improve the quality of automatic protein sequence alignment methods. The results also indicate guidelines for improvement of alignment algorithms.

Related Papers

• → Alignment of protein sequences by their profiles(2004)191 cited
• → Homology-extended sequence alignment(2005)119 cited
• → Dynamic use of multiple parameter sets in sequence alignment(2006)29 cited
• → ALIGN_MTX—An optimal pairwise textual sequence alignment program, adapted for using in sequence-structure alignment(2009)10 cited
• → Efficient Algorithms for Triple-wise Alignment and Its Applications(2010)