On Exact and Approximation Algorithms for Distinguishing Substring Selection
The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string which is, with respect to Hamming metric, “away” from the good strings and “close” to the bad strings.
Studying the parameterized complexity of DSSS, we show that DSSS is W-hard with respect to its natural parameters. This, in particular, implies that a recently given polynomial-time approximation scheme (PTAS) by Deng et al. cannot be replaced by a so-called efficient polynomial-time approximation scheme (EPTAS) unless an unlikely collapse in parameterized complexity theory occurs.
By way of contrast, for a special case of DSSS, we present an exact fixed-parameter algorithm solving the problem efficiently. In this way, we exhibit a sharp border between fixed-parameter tractability and intractability results.
KeywordsAlgorithms and complexity parameterized complexity approximation algorithms exact algorithms computational biology
Unable to display preview. Download preview PDF.
- 3.Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k mismatches. In: Proc. of 11th ACM-SIAM SODA, pp. 794–803 (2000)Google Scholar
- 7.Downey, R.G.: Parameterized complexity for the skeptic (invited paper). In: Proc. of 18th IEEE Conference on Computational Complexity (July 2003)Google Scholar
- 8.Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)Google Scholar
- 9.Evans, P.A., Smith, A., Wareham, H.T.: The parameterized complexity of p-center approximate substring problems. Technical report TR01-149, Faculty of Computer Science, University of New Brunswick, Canada (2001)Google Scholar
- 14.Lanctot, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. In: Proc. of 10th ACM-SIAM SODA, pp. 633–642 (1999)Google Scholar