Title: A hybrid metaheuristic for Closest String Problem

Authors: Sayyed Rasoul Mousavi

Addresses: Electrical and Computer Engineering Department, Isfahan University of Technology, Isfahan 84156-83111, Islamic Republic of Iran

Abstract: The Closest String Problem (CSP) is an optimisation problem, which is to obtain a string with the minimum distance from a number of given strings. In this paper, a new metaheuristic algorithm is investigated for the problem, whose main feature is relatively high speed in obtaining good solutions, which is essential when the input size is large. The proposed algorithm is compared with four recent algorithms suggested for the problem, outperforming them in more than 98% of the cases. It is also remarkably faster than all of them, running within 1 s in most of the experimental cases.

Keywords: bioinformatics; CSP; centre string problem; closest string problem; CBLS; computational biology; computational intelligence; gene clusters; heuristic functions; hybrid algorithms; metaheuristics; optimisation.

DOI: 10.1504/IJCBDD.2011.041413

International Journal of Computational Biology and Drug Design, 2011 Vol.4 No.3, pp.245 - 261

Available online: 21 Jul 2011 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article