Genetic design of drugs without side-effects

SIAM Journal on Computing

Volumn 32, Issue 4, 2003, Pages 1073-1090

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

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b SHANDONG UNIVERSITY   (China)

^c INSTITUTE OF SOFTWARE   (China)

^d UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Approximation algorithms; Computational molecular biology; Distinguishing substring selection

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DRUG PRODUCTS; MOLECULAR BIOLOGY;

GENETIC DESIGN;

GENETIC ALGORITHMS;

EID: 0141645222     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539701397825     Document Type: Article

References (12)

1. A. BEN-DOR, G. LANCIA, J. PERONE, AND R. RAVI, Banishing bias from consensus sequences, in Proceedings of the 8th Annual Combinatorial Pattern Matching Conference, Aarhus, Denmark, 1997, pp. 247-261.
2. J. DOPAZO, A. RODRÍGUEZ, J. C. SÁIZ, AND F. SOBRINO, Design of primers for PCR amplification of highly variable genomes, Comput. Appl. Biosci., 9 (1993), pp. 123-125.
3. L. GA̧SIENIEC, J. JANSSON, AND A. LINGAS, Efficient approximation algorithms for the Hamming center problem, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), Baltimore, MD, 1999, SIAM, Philadelphia, 1999, pp. S905-S906.
4. M. ITO, K. SHIMIZU, M. NAKANISHI, AND A. HASHIMOTO, Polynomial-time algorithms for computing characteristic strings, in Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching, Asilomar, CA, 1994, pp. 274-288.
5. J. K. LANCTOT, M. Li, B. MA, S. WANG, AND L. ZHANG, Distinguishing string selection problems, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), Baltimore, MD, 1999, SIAM, Philadelphia, 1999, pp. 633-642.
6. M. Li, B. MA, AND L. WANG, Finding similar regions in many strings, in Proceedings of the 31st ACM Symposium on Theory of Computing, Atlanta, GA, 1999, pp. 473-482.
7. M. Li, B. MA, AND L. WANG, On the closest string and substring problems, J. Assoc. Comput. Mach., 49 (2002), pp. 157-171.
8. K. LUCAS, M. BUSCH, S. MÖSSINGER, AND J.A. THOMPSON, An improved microcomputer program for finding gene- or gene family-specific oligonucleotides suitable as primers for polymerase chain reactions or as probes, Comput. Appl. Biosci., 7 (1991), pp. 525-529.
9. B. MA, A polynomial time approximation scheme for the closest substring problem, in Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching, Montreal, Canada, 2000, pp. 99-107.
10. R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Cambridge University Press, Cambridge, UK, 1995.
11. C.H. PAPADIMITRIOU AND M. YANNAKAKIS, On the approximability of trade-offs and optimal access of web sources, in Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, 2000, IEEE, pp. 86-92.
12. V. PROUTSKI AND E. C. HOLME, Primer master: A new program for the design and analysis of PCR primers, Comput. Appl. Biosci., 12 (1996), pp. 253-255.