A PTAS for distinguishing (sub)string selection

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

Volumn 2380 LNCS, Issue , 2002, Pages 740-751

  Deng, Xiaotie ^a   Li, Guojun ^b   Li, Zimao ^a   Ma, Bin ^c   Wang, Lusheng ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b SHANDONG UNIVERSITY   (China)

^c UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; AUTOMATA THEORY;

COMPUTATIONAL BIOLOGY; POLYNOMIAL TIME APPROXIMATION SCHEMES; SUBSTRING;

POLYNOMIAL APPROXIMATION;

EID: 84869200923     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_63     Document Type: Conference Paper

References (12)

1. A. Ben-Dor, G. Lancia, J. Perone, and R. Ravi, Banishing bias from consensus sequences, Proc. 8th Ann. Combinatorial Pattern Matching Conf., pp. 247-261, 1997.
2. J. Dopazo, A. Rodríguez, J. C. Sáiz, andF. Sobrino, Design of primers for PCR amplification of highly variable genomes, CABIOS, 9(1993), 123-125.
3. M. Frances, A. Litman, On covering problems of codes, Theor. Comput. Syst., 30(1997), 113-119.
4. L. Ga̧sieniec, J. Jansson, andA. Lingas, Efficient approximation algorithms for the Hamming center problem, Proc. 10th ACM-SIAM Symp. on Discrete Algorithms, pp. S905-S906, 1999.
5. M. Ito, K. Shimizu, M. Nakanishi, andA. Hashimoto, Polynominal-time algorithms for computing characteristic strings, Proc. 5th Annual Symposium on Combinatorial Pattern Matching, pp. 274-288, (1994).
6. K. Lucas, M. Busch, S. Mössinger andJ.A. Thompson, An improvedmicro computer program for finding gene- or gene family-specific oligonucleotides suitable as primers for polymerase chain reactions or as probes, CABIOS, 7(1991), 525-529.
7. K. Lanctot, M. Li, B. Ma, S. Wang, andL. Zhang, Distinguishing string selection problems, SODA'99, pp. 633-642..
8. Ming Li, Bin Ma,andLusheng Wang, "Finding similar regions in many strings", the 31th ACM Symp. on Theory of Computing, pp. 473-482, 1999.
9. B. Ma, A polynomial time approximation scheme for the closest substring problem, Proc. 11th Annual Symposium on Combinatorial Pattern Matching, pp. 99-107, Montreal, (2000).
10. R. Motwani andP . Raghavan, Randomized Algorithms, Cambridge Univ. Press, 1995.
11. C.H. Papadimitriou and M. Yannakakis, On the approximability of trade-offs and optimal access of web sources, FOCS00 , pp. 86-92, 2000.
12. V. Proutski andE. C. Holme, Primer Master: a new program for the design and analysis of PCR primers, CABIOS, 12(1996), 253-255.