Finding similar regions in many strings
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Distinguishing string selection problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the closest string and substring problems
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Some string problems in computational biology
Some string problems in computational biology
Genetic Algorithm Approach for the Closest String Problem
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Distinguishing string selection problems
Information and Computation
Ant colony optimization theory: a survey
Theoretical Computer Science
Combinatorial Pattern Matching: 15th Annual Symposium, CPM 2004, Istanbul, Turkey, July 5-7, 2004, Proceedings (Lecture Notes in Computer Science)
Optimal Solutions for the Closest-String Problem via Integer Programming
INFORMS Journal on Computing
A parallel multistart algorithm for the closest string problem
Computers and Operations Research
An improved lower bound on approximation algorithms for the Closest Substring problem
Information Processing Letters
A data-based coding of candidate strings in the closest string problem
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Exact Solutions for Closest String and Related Problems
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Computation of median gene clusters
RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
More efficient algorithms for closest string and substring problems
RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
Swiftly computing center strings
WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
A probabilistic heuristic for a computationally difficult set covering problem
Operations Research Letters
| Hi-index | 0.01 |
The Closest String Problem (CSP) is the problem of finding a string whose Hamming distance from the members of a given set of strings of the same length is minimal. It has applications, among others, in bioinformatics and in coding theory. Several approximation and (meta)heuristic algorithms have been proposed for the problem to achieve 'good' but not necessarily optimal solutions within a reasonable time. In this paper, a new algorithm for the problem is proposed, based on a Greedy Randomized Adaptive Search Procedure (GRASP) and a novel probabilistic heuristic function. The algorithm is compared with three recently proposed algorithms for CSP, outperforming all of them by achieving solutions of higher quality within a few seconds in most of the experimental cases.