By Topic

The closest substring problem with small distances

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Marx, D. ; Dept. of Comput. Sci. & Inf. Theor., Budapest Univ. of Technol. & Econ., Hungary

In the closest substring problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si, has a consecutive substring of length L whose distance is at most d from s. The problem is motivated by applications in computational biology. We present two algorithms that can be efficient for small fixed values of d and k: for some functions f and g, the algorithms have running time f(d) · n(O(log d)) and g(d,k) · n(O(log log k)), respectively. The second algorithm is based on connections with the extremal combinatorics of hypergraphs. The closest substring problem is also investigated from the parameterized complexity point of view. Answering an open question from (Evans et al., 2003; Fellows et al.; Gramm et al., 2003), we show that the problem is W[1] hard even if both d and k are parameters. It follows as a consequence of this hardness result that our algorithms are optimal in the sense that the exponent of n in the running time cannot be improved to o(log d) or to o(log log k) (modulo some complexity-theoretic assumptions). Another consequence is that the running time nO(1ε4)/ of the approximation scheme for closest substring presented in (Li et al., 2002) cannot be improved to f(ε) · nc, i.e. the ε has to appear in the exponent of n.

Published in:

Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on

Date of Conference:

23-25 Oct. 2005