Parameterized intractability of distinguishing substring selection

Theory of Computing Systems

Volumn 39, Issue 4, 2006, Pages 545-560

  Gramm, Jens ^a   Guo, Jiong ^b   Niedermeier, Rolf ^b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY ALPHABETS; COMPUTATIONAL BIOLOGY; FIXED-PARAMETER ALGORITHMS; FIXED-PARAMETER TRACTABILITY; GENETIC MARKERS; PARAMETERIZED COMPLEXITY; POLYNOMIAL TIME APPROXIMATION SCHEMES; SELECTION PROBLEMS;

BIOINFORMATICS; DNA SEQUENCES; HAMMING DISTANCE;

PROBLEM SOLVING;

EID: 33745050220     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-004-1185-z     Document Type: Article

References (23)

1. K. Abrahamson. Generalized string matching. SIAM Journal on Computing, 16(6):1039-1051, 1987.
2. J. Alber, J. Gramm, and R. Niedermeier. Faster exact solutions for hard problems: a parameterized point of view. Discrete Mathematics, 229(1-3):3-27, 2001.
3. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation - Combinatorial Optimization Problems and Their Approximability Properties. Springer, New York, 1999.
4. M. Cesati and L. Trevisan. On the efficiency of polynomial time approximation schemes. Information Processing Letters, 64(4):165-171, 1997.
5. J. Chen, I. Kanj, and W. Jia. Vertex Cover: further observations and further improvements. Journal of Algorithms, 41(2):280-301, 2001.
6. X. Deng, G. Li, Z. Li, B. Ma, and L. Wang. A PTAS for Distinguishing (Sub)string Selection. In Proc. of 29th ICALP, volume 2380 in LNCS, pages 740-751. Springer, Berlin, 2002.
7. X. Deng, G. Li, Z. Li, B. Ma, and L. Wang. Genetic design of drugs without side-effects. SIAM Journal on Computing, 32(4): 1073-1090, 2003.
8. X. Deng, G. Li, and L. Wang. Center and distinguisher for strings with unbounded alphabet. Journal of Combinatorial Optimization, 6:383-400, 2002.
9. R. G. Downey. Parameterized complexity for the skeptic (invited paper). In Proc. of 18th IEEE Conference on Computational Complexity, pages 147-169, 2003.
10. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, New York, 1999.
11. P. A. Evans, A. Smith, and H. T. Wareham. On the complexity of finding common approximate substrings. Theoretical Computer Science, 306:407-430, 2003.
12. M. R. Fellows. Parameterized complexity: the main ideas and connections to practical computing. In Experimental Algorithmics, volume 2547 in LNCS, pages 51-77. Springer, Berlin, 2002.
13. M. R. Fellows. New directions and new challenges in algorithm design and complexity, parameterized (invited paper). In Proc. of 8th WADS, volume 2748 in LNCS, pages 505-519. Springer, Berlin, 2003.
14. M. R. Fellows, J. Gramm, and R. Niedermeier. On the parameterized intractability of Closest Substring and related problems. In Proc. of 19th STACS, volume 2285 in LNCS, pages 262-273. Springer, Berlin, 2002. Revised version to appear in Combinatorica.
15. M. Frances and A. Litman. On covering problems of codes. Theory of Computing Systems, 30:113-119, 1997.
16. J. Gramm, R. Niedermeier, and P. Rossmanith. Fixed-parameter algorithms for Closest String and related problems. Algorithmica, 37(1):25-42, 2003.
17. D. S. Hochbaum. Approximation Algorithms for NP-Hard Problems. PWS, Boston, MA, 1997.
18. J. K. Lanctot, M. Li, B. Ma, S. Wang, and L. Zhang. Distinguishing string selection problems. Information and Computation, 185:41-55, 2003.
19. M. Li, B. Ma, and L. Wang. On the Closest String and Substring Problems. Journal of the ACM, 49(2):157-171, 2002.
20. M. Li, B. Ma, and L. Wang. Finding similar regions in many sequences, Journal of Computer and System Sciences, 65(1):73-96, 2002.
21. R. Niedermeier and P. Rossmanith. Upper bounds for Vertex Cover further improved. In Proc. of 16th STACS, volume 1563 in LNCS, pages 561-570. Springer, Berlin, 1999.
22. R. Niedermeier and P. Rossmanith. On efficient fixed-parameter algorithms for Weighted Vertex Cover. Journal of Algorithms, 47:63-77, 2003.
23. V. V. Vazirani. Approximation Algorithms. Springer, New York, 2001.