On the closest string and substring problems

Journal of the ACM

Volumn 49, Issue 2, 2002, Pages 157-171

  Li, Ming ^a,d   Ma, Bin ^b   Wang, Lusheng ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^d University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSEST STRING; CODING THEORY; GENETIC DRUG TARGETS; SUBSTRING PROBLEMS;

BIOSENSORS; COMPUTATION THEORY; CONTROLLED DRUG DELIVERY; GENETIC ALGORITHMS; MOLECULAR BIOLOGY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

CODES (SYMBOLS);

EID: 0141653290     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/506147.506150     Document Type: Article

References (28)

1. ARORA, S., KARGER, D., AND KARPINSKI, M. 1995. Polynomial time approximation schemes for dense instances of NP-hard problems. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing. ACM, New York, pp. 284-293.
2. BEN-DOR, A., LANCIA, G., PERONE, J., AND RAVI, R. 1997. Banishing bias from consensus sequences. In Proceedings of the 8th Annual Combinatorial Pattern Matching Conference. pp. 247-261.
3. BERMAN, P., GUMUCIO, D., HARDISON, R., MILLER, W., AND STOJANOVIC, N. 1997. A linear-time algorithm for the 1-mismatch problem. In Proceedings of the Workshops on Algorithms and Data Structures. pp. 126-135.
4. DOPAZO, J., RODRÍGUEZ, A., SÁIZ, J. C., AND SOBRINO, F. 1993. Design of primers for PCR amplification of highly variable genomes. CABIOS 9, 123-125.
5. FRANCES, M., AND LITMAN, A. 1997. On covering problems of codes. Theoret. Comput. Syst. 30, 113-119.
6. GA̧SIENIEC, L., JANSSON, J., AND LINGAS, A. 1999. Efficient approximation algorithms for the Hamming center problem. In Proceedings of the 10th Animal ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. S905-S906.
7. GILLMAN, D. 1993. A Chernoff bound for random walks on expanders. In Proceedings of the 34th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 680-691.
8. GUSFIELD, D. 1993. Efficient methods for multiple sequence alignment with guaranteed error bounds. Bull. Math. Biol. 30, 141-154.
9. GUSFIELD, D. 1997. Algorithms on Strings, Trees, and Sequences. Cambridge Univ. Press.
10. HERTZ, G., AND STORMO, G. 1995. Identification of consensus patterns in unaligned DNA and protein sequences: a large-deviation statistical basis for penalizing gaps. In Proceedings of the 3rd International Conference on Bioinformatics and Genome Research. pp. 201-216.
11. LAWRENCE, C., AND REILLY, A. 1990. An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences. Proteins 7, pp. 41-51.
12. LUCAS, K., BUSCH, M., MÖSSINGER, S., AND THOMPSON, J. A. 1991. An improved microcomputer program for finding gene- or gene family-specific oligonucleotides suitable as primers for polymerase chain reactions or as probes. CABIOS, 7, 525-529.
13. LANCTOT, K., LI, M., MA, B., WANG, S., AND ZHANG, L. 1999. Distinguishing string selection problems. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 633-642. Also to appear in Inf. Comput.
14. LI, M., MA, B., AND WANG, L. 1999. Finding similar regions in many strings. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (Atlanta, Ga.). ACM, New York, pp. 473-482.
15. LI, M., MA, B., AND WANG, L. 2001. Finding similar regions in many sequences. J. Comput. Syst. Sci. (special issue for 31st Annual ACM Symposium on Theory of Computing) to appear.
16. LIANG, C., LI, M., AND MA, B. 2001. COPIA - A consensus pattern identification and analysis software system. Manuscript. Software available at: http://dna.cs.ucsb.edu/copia/copia_submit.html.
17. MA, B. 2000. A polynomial time approximation scheme for the closest substring problem. In Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching (Montreal, Ont., Canada), pp. 99-107.
18. MOTWANI, R., AND RAGHAVAN, P. 1995. Randomized Algorithms, Cambridge Univ. Press.
19. PEVZNER, P. A. 2000. Computational molecular biology - An algorithmic approach. The MIT Press, Cambridge, Mass.
20. POSFAI, J., BHAGWAT, A., POSFAI, G., AND ROBERTS, R. 1989. Predictive motifs derived from cytosine methyltransferases. Nucl. Acids Res. 17, 2421-2435.
21. PROUTSKI, V., AND HOLME, E. C. 1996. Primer master: A new program for the design and analysis of PCR primers. CABIOS 12, 253-255.
22. RAGHAVAN, P. 1988. Probabilistic construction of deterministic algorithms: Approximate packing integer programs. J. Comput. Syst. Sci. 37, 2, 130-143.
23. SCHULER, G. D., ALTSCHUL, S. F., AND LIPMAN, D. J. 1991. A workbench for multiple alignment construction and analysis. Proteins: Struct. Funct. Genet. 9, 180-190.
24. STORMO, G. 1990. Consensus patterns in DNA. In Molecular Evolution: Computer Analysis of Protein and Nucleic Acid Sequences, R. F. Doolittle, Ed. Methods in Enzymology, vol. 183, pp. 211-221.
25. STORMO, G., AND HARTZELL III, G. W. 1991. Identifying protein-binding sites from unaligned DNA fragments. Proc. Natl. Acad. Sci. USA 88, 5699-5703.
26. WATERMAN, M. 1986. Multiple sequence alignment by consensus. Nucl. Acids Res. 14, 9095-9102.
27. WATERMAN, M., ARRATIA, R., AND GALAS, D. 1984. Pattern recognition in several sequences: Consensus and alignment. Bull. Math. Biol. 46, 515-521.
28. WATERMAN, M., AND PERLWITZ, M. 1984. Line geometries for sequence comparisons. Bull. Math. Biol. 46, 567-577.