An improved lower bound on approximation algorithms for the ...
www.sciencedirect.com › article › pii
Jun 30, 2008 · The Closest Substring problem (the CSP problem) is a basic NP-hard problem in the study of computational biology.
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 ...
The Closest Substring problem (CSP), where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, ...
TL;DR: A new algorithm for the Closest String Problem is proposed, based on a Greedy Randomized Adaptive Search Procedure and a novel probabilistic heuristic ...
People also ask
How to find the lower bound of an algorithm?
What is the approximation ratio of the approximation algorithm?
1998 ACM Subject Classification F.2.2 Nonnumerical algorithms and problems ... For the more general Closest Substring problem, this question was answered ...
The Closest Substring problem (CSP), where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, ...
Missing: improved | Show results with:improved
The solution to such an LP is a lower bound on the true binary minimum. We say, an LP relaxation A is weakly stronger than an LP relaxation B if its optimal ...
A Closer Look at the Closest String and Closest Substring Problem ... An improved lower bound on approximation algorithms for the Closest Substring problem.
Abstract. In this paper we consider the problem of finding the ap- proximate nearest neighbor when the data set points are the substrings of a given text T.
Closest Substring is a core problem in the field of consensus string analysis with, in particular, applications in computational biology.