ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Computational Biology and Chemistry
Volume 28, Issue 2, April 2004, Pages 141-148
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (98 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.compbiolchem.2004.02.001    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2004 Elsevier Ltd. All rights reserved.

An adaptive and iterative algorithm for refining multiple sequence alignment

Yi Wang and Kuo-Bin LiCorresponding Author Contact Information, E-mail The Corresponding Author

Bioinformatics Institute, 30 Biopolis Street, Singapore 138671, Singapore

Received 2 December 2003; 
Revised 10 February 2004; 
accepted 10 February 2004. 
Available online 4 May 2004.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

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.

Author Keywords: Iterative algorithm; Multiple sequence alignment; Alignment improver

Article Outline

1. Introduction
2. Algorithm
2.1. Pairwise library
2.2. Objective function
2.3. Exhaustive and greedy gap move
2.4. Detection and isolation of well-aligned regions
2.5. Insertion of column-gaps as buffer
2.6. Random insertion of column-gaps
3. Results
4. Discussion
Acknowledgements
References







 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.