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.
| Original language | English |
|---|---|
| Pages (from-to) | 245-261 |
| Number of pages | 17 |
| Journal | International Journal of Computational Biology and Drug Design |
| Volume | 4 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - Jul 2011 |
| Externally published | Yes |
Keywords
- 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