Complexity of approximating closest substring problems

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

Volumn 2751, Issue , 2003, Pages 210-221

  Evans, Patricia A ^a   Smith, Andrew D ^a,b  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

^b PRINCESS MARGARET HOSPITAL   (Canada)

Author keywords

Approximation algorithms; Closest Substring; Hardness of approximation

Indexed keywords

HARDNESS; POLYNOMIAL APPROXIMATION;

APPROXIMABILITY; APPROXIMATION BOUNDS; CLOSEST SUBSTRING PROBLEMS; HARDNESS OF APPROXIMATION; MINIMIZATION PROBLEMS; OBJECTIVE FUNCTIONS; POLYNOMIAL TIME APPROXIMATION SCHEMES; SUBSTRING;

APPROXIMATION ALGORITHMS;

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

References (8)

1. Sanjeev Arora. Probabilistic checking of proofs and the hardness of approximation problems. PhD thesis, UC Berkeley, 1994.
2. Carsten Lund and Mihalis Yannakakis. On the hardness of approximating minimization problems. Journal of the ACM, 41(5), 1994.
3. Ran Raz and Shmuel Safra. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In Proceedings of the Annual ACM Symposium on Theory of Computing, 475-484, 1997.
4. Uriel Feige. A threshold of log n for approximating set cover. Journal of the ACM, 45(4):634-652, 1998.
5. J. K. Lanctot, M. Li, B. Ma, S. Wang, and L. Zhang. Distinguishing string selection problems. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 633-642. ACM Press, 1999.
6. Ming Li, Bin Ma, and Lusheng Wang. On the closest string and substring problems. Journal of the ACM, 49(2):157-171, 2002.
7. Bin Ma. A polynomial time approximation scheme for the closest substring problem. In Combinatorial Pattern Matching (CPM 2000), Lecture Notes in Computer Science 1848, 99-107. Springer, 2000.
8. Marie-France Sagot. Spelling approximate repeated or common motifs using a suffix tree. In LATIN'98, Lecture Notes in Computer Science 1380, 374-390. Springer, 1998.