Abstract
The Closest Substring Problem is to decide, for given strings s1, … , sk of length at most ℓ and numbers m and d, whether there is a length-m string s and length-m substrings s′i of si, such that s has a Hamming distance of at most d from each s′i. If we instead require the sum of all the Hamming distances between s and each s′i to be bounded by d, then it is called the Consensus Patterns Problem. We contribute to the parameterised complexity analysis of these classical NP-hard string problems by investigating the parameter (ℓ − m), i.e., the length difference between input and solution strings. For most combinations of (ℓ − m) and one of the classical parameters (m, ℓ, k, or d), we obtain fixed-parameter tractability. However, even for constant (ℓ − m) and constant alphabet size, both problems remain NP-hard. While this follows from known results with respect to the Closest Substring, we need a new reduction in the case of the Consensus Patterns. As a by-product of this reduction, we obtain an exact exponential-time algorithm for both problems, which is based on an alphabet reduction.
- L. Bulteau, F. Hüffner, C. Komusiewicz, and R. Niedermeier. 2014. Multivariate algorithmics for NP-hard string problems. Bulletin of the EATCS 114 (2014), 31--73.Google Scholar
- P. A. Evans, A. D. Smith, and H. T. Wareham. 2003. On the complexity of finding common approximate substrings. Theoretical Computer Science 306 (2003), 407--430. Google Scholar
Digital Library
- M. R. Fellows, J. Gramm, and R. Niedermeier. 2006. On the parameterized intractability of motif search problems. Combinatorica 26 (2006), 141--167. Google Scholar
Digital Library
- J. Flum and M. Grohe. 2006. Parameterized Complexity Theory. Springer-Verlag New York, Inc. Google Scholar
Digital Library
- M. Frances and A. Litman. 1997. On covering problems of codes. Theory of Computing Systems 30 (1997), 113--119.Google Scholar
Cross Ref
- M. R. Garey and D. S. Johnson. 1979. Computers and Intractability. W. H. Freeman and Company.Google Scholar
- J. Gramm, R. Niedermeier, and P. Rossmanith. 2003. Fixed-parameter algorithms for CLOSEST STRING and related problems. Algorithmica 37 (2003), 25--42. Google Scholar
Digital Library
- D. Marx. 2008. Closest substring problems with small distances. SIAM Journal on Computing 38 (2008), 1382--1410. Google Scholar
Digital Library
- M. L. Schmid. 2015. Finding consensus strings with small length difference between input and solution strings. In Proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science (Part II) (MFCS’15) Lecture Notes in Computer Science, Vol. 9235. 542--554.Google Scholar
Cross Ref
Index Terms
Finding Consensus Strings with Small Length Difference between Input and Solution Strings
Recommendations
Computing equality-free and repetitive string factorisations
For a string w, a factorisation is any tuple ( u 1 , u 2 , , u k ) of strings that satisfies w = u 1 u 2 u k . A factorisation is called equality-free if each two factors are different, its size is the number of factors (counting each occurrence of ...
On the Parameterised Complexity of String Morphism Problems
Given a source string u and a target string w, to decide whether w can be obtained by applying a string morphism on u (i. e., uniformly replacing the symbols in u by strings) constitutes an źźźź$\mathcal {NP}$-complete problem. We present a multivariate ...
(Prefix) reversal distance for (signed) strings with few blocks or small alphabets
We study the String Reversal Distance problem, an extension of the well-known Sorting by Reversals problem. String Reversal Distance takes two strings S and T built on an alphabet Σ as input, and asks for a minimum number of reversals to obtain T from ...






Comments