On the closest string and substring problems
Journal of the ACM (JACM)
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Distinguishing string selection problems
Information and Computation
The Closest Substring problem with small distances
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Parameterized Intractability of Distinguishing Substring Selection
Theory of Computing Systems
Strong computational lower bounds via parameterized complexity
Journal of Computer and System Sciences
A GRASP algorithm for the Closest String Problem using a probability-based heuristic
Computers and Operations Research
An improved heuristic for the far from most strings problem
Journal of Heuristics
Hi-index | 0.89 |
The Closest Substring problem (the CSP problem) is a basic NP-hard problem in the study of computational biology. It is known that the problem has polynomial time approximation schemes. In this paper, we prove that unless the Exponential Time Hypothesis fails, the CSP problem has no polynomial time approximation schemes of running time f(1/@e)n^o^(^1^/^@e^) for any function f. This essentially excludes the possibility that the CSP problem has a practical polynomial time approximation scheme even for moderate values of the error bound @e. As a consequence, it is unlikely that the study of approximation schemes for the CSP problem in the literature would lead to practical approximation algorithms for the problem for small error bound @e.