YI Wang

A tabu search algorithm for post processing multiple sequence alignment

Published date : 01 Jan 2004

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.

Journal Paper
Journal of Bioinformatics and Computational Biology, 2004
Impact Factor