An adaptive and iterative algorithm for refining multiple sequence alignment.
Multiple sequence alignment is a basic tool in computational genomics. The art of multiple sequence alignment is about placing gaps. This paper presents a heuristic algorithm that improves multiple protein sequences alignment iteratively. A consistency-based objective function is used to evaluate the candidate moves. During the iterative optimization, well-aligned regions can be detected and kept intact. Columns of gaps will be inserted to assist the algorithm to escape from local optimal alignments. The algorithm has been evaluated using the BAliBASE benchmark alignment database. Results show that the performance of the algorithm does not depend on initial or seed alignments much. Given a perfect consistency library, the algorithm is able to produce alignments that are close to the global optimum. We demonstrate that the algorithm is able to refine alignments produced by other software, including ClustalW, SAGA and T-COFFEE. The program is available upon request.
Wang
Yi
Y
Bioinformatics Institute, 30 Biopolis Street, Singapore 138671, Singapore.
Li
Kuo-Bin
KB
D000465:Algorithms; D000595:Amino Acid Sequence; D016000:Cluster Analysis; D016208:Databases, Factual; D008969:Molecular Sequence Data; D016415:Sequence Alignment / Q000379:methods*; D012984:Software