title: A tabu search algorithm for post-processing multiple sequence alignment.
abstract: Tabu search is a meta-heuristic approach that is proven to be useful in solving combinatorial optimization problems. We implement the adaptive memory features of tabu search to refine a multiple sequence alignment. Adaptive memory helps the search process to avoid local optima and explores the solution space economically and effectively without getting trapped into cycles. The algorithm is further enhanced by introducing extended tabu search features such as intensification and diversification. The neighborhoods of a solution are generated stochastically and a consistency-based objective function is employed to measure its quality. The algorithm is tested with the datasets from BAliBASE benchmarking database. We have observed through experiments that tabu search is able to improve the quality of multiple alignments generated by other software such as ClustalW and T-Coffee. The source code of our algorithm is available at http://www.bii.a-star.edu.sg/~tariq/tabu/.
authors.affiliation: Bioinformatics Institute, 30 Biopolis Street, Singapore 138671, Singapore. tariq@bii.a-star.edu.sg
authors.forename: Tariq
authors.initials: T
authors.lastname: Riaz
authors.forename: Wang
authors.initials: W
authors.lastname: Yi
authors.forename: Kuo-Bin
authors.initials: KB
authors.lastname: Li
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D017124:Conserved Sequence; D016415:Sequence Alignment / Q000379:methods*; D017421:Sequence Analysis / Q000379:methods*; D017385:Sequence Homology