Finding similar regions in many sequences

Journal of Computer and System Sciences

Volumn 65, Issue 1, 2002, Pages 73-96

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

^a University of California   (United States)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Approximation algorithms; Computational biology; Consensus alignment; Consensus patterns

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DNA; FUNCTIONS; INTEGRATION; MATHEMATICAL MODELS; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; COMPUTATIONAL BIOLOGY; CONSENSUS ALIGNMENT; CONSENSUS PATTERNS;

MOLECULAR BIOLOGY;

EID: 10044245485     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1006/jcss.2002.1823     Document Type: Conference Paper

References (26)

1. V. Bafna, E. Lawler, and P. Pevzner, Approximation algorithms for multiple sequence alignment, in "Proc. 8th Ann. Combinatorial Pattern Matching Conf. (CPM'94)," pp. 43-53, 1994.
2. Q. Chan, G. Hertz, and Q. Stormo, Matrix search 1.0: a computer program that scans DNA sequences for transcriptional elements using a database of weight matrices, Comput. Appl. Biosci. (1995), 563-566.
3. Y. M. Fraenkel, Y. Mandel, D. Friedberg, and H. Margalit, Identification of common motifs in unaligned DNA sequences: application to Escherichia coli Lrp regulon, Comput. Appl. Biosci. (1995), 379-387.
4. M. Garey and D. Johnson, "Computers and Intractability, a Guild to the Theory of NP-Completeness," Freeman, New York, 1979.
5. D. Gusfield, Efficient methods for multiple sequence alignment with guaranteed error bounds, Bull. Math. Biol. 30 (1993), 141-154.
6. D. Gusfield, "Algorithms on Strings, Trees, and Sequences," Cambridge Univ. Press, Cambridge, UK, 1997.
7. G. Hertz and G. Stormo, Identification of consensus patterns in unaligned DNA and protein sequences: a large-deviation statistical basis for penalizing gaps, in "Proc. 3rd Int'l Conf. Bioinformatics and Genome Research" (Lim and Cantor, Eds.) pp. 201-216, World Scientific, Singapore, 1995.
8. R. Karp, Reducibility among combinatorial problems, in "Complexity of Computer Computation" (R. E. Miller and J. W. Thatcher, Eds.) pp. 85-103, Plenum Press, New York, 1972.
9. Y. V. Kondrakhin, A. E. Kel, N. A. Kolchanov, A. G. Romashchenko, and L. Milanesi, Eukaryotic promoter recognition by binding sites for transcription factors, Comput. Appl. Biosci. (1995), 477-488.
10. C. Lawrence and A. Reilly, An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences, Proteins 7 (1990), 41-51.
11. C. Liang, M. Li, and B. Ma, COPIA: A new software tool for finding consensus patterns in unaligned sequences, manuscript, 2001.
12. M. Li, B. Ma, and L. Wang, On the closest string and substring problems, to appear in Journal of the ACM, 2002.
13. B. Ma, A polynomial time approximation scheme for the closest substring problem, m "CPM "2000," Lecture Notes in Computer Science, Vol. 1848, pp. 99-107, Springer-Verlag, Berlin/New York, 2000.
14. R. Motwani and P. Raghavan, "Randomized Algorithms," Cambridge Univ. Press, Cambridge, UK, 1995.
15. P. Pevzner, Multiple alignment, communication cost, and graph matching, SIAM J. Appl. Math. 52 (1992), 1763-1779.
16. J. Posfai, A. Bhagwat, G. Posfai, and R. Roberts, Predictive motifs derived from cytosine methyltransferases, Nucl. Acids Res. 17 (1989), 2421-2435.
17. D. S. Prestridge, SIGNAL SCAN 4.0: additional databases and sequence formats, Comput. Appl. Biosci. (1996), 157-160.
18. M. A. Roytberg, A search for common patterns in many sequences, Comput. Appl. Biosci. (1992), 57-64.
19. G. D. Schuler, S. F. Altschul, and D. J. Lipman, A workbench for multiple alignment construction and analysis, Proteins: Structure. Function Genetics 9 (1991), 180-190.
20. G. Stormo, Consensus patterns in DNA, in "Molecular Evolution: Computer Analysis of Protein and Nucleic Acid Sequences, Methods in Enzymology" (R. F. Doolittle, Ed.), Vol. 183, pp. 211-221, 1990.
21. G. Stormo and G. W. Hartzell III, Identifying protein-binding sites from unaligned DNA fragments, Proc. Natl. Acad. Sci. USA 88 (1991), 5699-5703.
22. L. Wang and T. Jiang, On the complexity of multiple sequence alignment, J. Comp. Biol. 1 (1994), 337-348.
23. M. Waterman, Multiple sequence alignment by consensus, Nucl. Acids Res. 14 (1986), 9095-9102.
24. M. Waterman, R. Arratia, and D. Galas, Pattern recognition in several sequences: consensus and alignment, Bull. Math. Biol. 46 (1984), 515-527.
25. M. Waterman and M. Perlwitz, Line geometries for sequence comparisons, Bull. Math. Biol. 46 (1984), 567-577.
26. F. Wolfertstetter, K. Frech, G. Herrmann, and T. Werner, Comput. Appl. Biosci. (1996), 71-80.