A polynomial time approximation scheme for the closest substring problem

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

Volumn 1848, Issue , 2000, Pages 99-107

  Ma, Bin ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; HAMMING DISTANCE; PATTERN MATCHING;

CLOSEST SUBSTRING PROBLEMS; DRUG TARGETS; FOLLOWING PROBLEM; NON-TRIVIAL; NP-HARD; POLYNOMIAL TIME APPROXIMATION SCHEMES; SUBSTRING;

POLYNOMIAL APPROXIMATION;

EID: 84937390208     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45123-4_10     Document Type: Conference Paper

References (11)

1. A. Ben-Dor, G. Lancia, J. Perone, and R. Ravi, Banishing Bias from Consensus Sequences, Combinatorial Pattern Matching, 8th Annual Symposium, Springer-Verlag, Berlin, 1997.
2. S. Crooke and B. Lebleu (editors), Antisense Research and Applications, CRC Press, 1993.
3. M. Frances and A. Litman, On covering problems of codes, Theory of Computing Systems, vol. 30, pp. 113-119, 1997.
4. L. Gąsieniec, J. Jansson, and A. Lingas, Eficient approximation algorithms for the Hamming center problem, Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 905-906, San Francisco, 1999.
5. E. M. Hillis, C. Moritz, and B. K. Mable, Molecular Systematics, 2nd ed., Sinauer Associates Inc., Sunderland, 1996.
6. K. Lanctot, M. Li, B. Ma, S. Wang, and L. Zhang, Distinguish string search problems, Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 633-642, San Francisco, 1999.
7. M. Li, B. Ma, and L. Wang, Finding similar regions in many strings, Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing, pp. 473-482, Atlanta, 1999.
8. B. Ma, Some approximation algorithms on strings and trees, Ph.D. Thesis, Peking University, 1999.
9. A. Macario and E. Macario, Gene Probes for Bacteria, Academic Press, 1990.
10. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
11. L. Wang, Personal Communication, 1999.