A hybrid metaheuristic for Closest String Problem

Sayyed Rasoul Mousavi

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


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.

Original languageEnglish
Pages (from-to)245-261
Number of pages17
JournalInternational Journal of Computational Biology and Drug Design
Issue number3
Publication statusPublished - Jul 2011
Externally publishedYes


  • Bioinformatics
  • CBLS
  • Centre string problem
  • Closest String Problem
  • Computational biology
  • Computational intelligence
  • CSP
  • Gene clusters
  • Heuristic functions
  • Hybrid algorithms
  • Metaheuristics

ASJC Scopus subject areas

  • Drug Discovery
  • Computer Science Applications


Dive into the research topics of 'A hybrid metaheuristic for Closest String Problem'. Together they form a unique fingerprint.

Cite this