On exact and approximation algorithms for distinguishing substring selection

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2751, Issue , 2003, Pages 195-209

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

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

Algorithms and complexity; Approximation algorithms; Computational biology; Exact algorithms; Parameterized complexity

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BIOINFORMATICS; COMPUTATIONAL COMPLEXITY; PARAMETER ESTIMATION; PARAMETERIZATION; POLYNOMIAL APPROXIMATION;

ALGORITHMS AND COMPLEXITY; COMPUTATIONAL BIOLOGY; EXACT ALGORITHMS; FIXED-PARAMETER ALGORITHMS; FIXED-PARAMETER TRACTABILITY; PARAMETERIZED COMPLEXITY; POLYNOMIAL TIME APPROXIMATION SCHEMES; SELECTION PROBLEMS;

APPROXIMATION ALGORITHMS;

EID: 21144456083     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45077-1_19     Document Type: Article

References (17)

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. A. Amir, M. Lewenstein, and E. Porat. Faster algorithms for string matching with k mismatches. In Proc. of 11th ACM-SIAM SODA, pages 794-803, 2000.
4. 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, 1999.
5. M. Cesati and L. Trevisan. On the efficiency of polynomial time approximation schemes. Information Processing Letters, 64(4):165-171, 1997.
6. X. Deng, G. Li, Z. Li, B. Ma, and L. Wang. A PTAS for Distinguishing (Sub)string Selection. In Proc. of 29th ICALP, number 2380 in LNCS, pages 740-751, 2002. Springer.
7. R. G. Downey. Parameterized complexity for the skeptic (invited paper). In Proc. of 18th IEEE Conference on Computational Complexity, July 2003.
8. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
9. P. A. Evans, A. Smith, and H. T. Wareham. The parameterized complexity of p-center approximate substring problems. Technical report TR01-149, Faculty of Computer Science, University of New Brunswick, Canada. 2001.
10. M. R. Fellows. Parameterized complexity: the main ideas and connections to practical computing. In Experimental Algorithmics, number 2547 in LNCS, pages 51-77, 2002. Springer.
11. M. R. Fellows, J. Gramm, and R. Niedermeier. On the parameterized intractability of Closest Substring and related problems. In Proc. of 19th STACS, number 2285 in LNCS, pages 262-273, 2002. Springer.
12. M. Frances and A. Litman. On covering problems of codes. Theory of Computing Systems, 30:113-119, 1997.
13. J. Gramm, R. Niedermeier, and P. Rossmanith. Exact solutions for Closest String and related problems. In Proc. of 12th ISAAC, number 2223 in LNCS, pages 441-453, 2001. Springer.
14. Full version to appear in Algorithmica.
15. J. K. Lanctot, M. Li, B. Ma, S. Wang, and L. Zhang. Distinguishing string selection problems. In Proc. of 10th ACM-SIAM SODA, pages 633-642, 1999.
16. M. Li, B. Ma, and L. Wang. On the Closest String and Substring Problems. Journal of the ACM, 49(2):157-171, 2002.
17. M. Li, B. Ma, and L. Wang. Finding similar regions in many sequences, Journal of Computer and System Sciences, 65(1):73-96, 2002.