Combinatorial Approaches to Finding Subtle Signals in DNA Sequences

Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology, ISMB 2000

Volumn , Issue , 2000, Pages 269-278

  Pevzner, Pavel A ^a   Sze, Sing Hoi ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

multiple alignment; pattern discovery

Indexed keywords

ARTIFICIAL INTELLIGENCE; DNA; LEARNING SYSTEMS; MOLECULAR BIOLOGY;

COMBINATORIAL APPROACH; DRUG TARGET IDENTIFICATION; MACHINE LEARNING APPROACHES; MULTIPLE ALIGNMENT; PATTERN DISCOVERY; STATISTICAL LEARNING;

DNA SEQUENCES;

DNA;

ALGORITHM; ANIMAL; ARTICLE; DNA SEQUENCE; GENETICS; HUMAN;

ALGORITHMS; ANIMALS; DNA; HUMANS; SEQUENCE ANALYSIS, DNA;

EID: 0034565285     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. Akutsu, T.; Arimura, H.; and Shimozono, S. 2000. On approximation algorithms for local multiple alignment. In Istrail, S.; Pevzner, P.; and Waterman, M., eds., Proceedings of the Fourth Annual International Conference on Computational Molecular Biology (RECOMB-00), 1-7. Tokyo, Japan: ACM Press.
2. Alon, N.; Krivelevich, M.; and Sudakov, B. 1998. Finding a large hidden clique in a random graph. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), 594-598. SIAM Press.
3. Bailey, T., and Elkan, C. 1995. Unsupervised learning of multiple motifs in biopolymers using expectation maximization. Machine Learning 21:51-80.
4. Brazma, A.; Jonassen, I.; Eidhammer, I.; and Gilbert, D. 1998. Approaches to the automatic discovery of patterns in biosequences. Journal of Computational Biology 5:279-305.
5. Fraenkel, Y.; Mandel, Y.; Friedberg, D.; and Margalit, H. 1995. Identification of common motifs in unaligned DNA sequences: application to Escherichia coli Lrp regulon. Computer Applications in Biosciences 11 (4) :379-387.
6. Garey, M., and Johnson, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman and Co.
7. Gelfand, M.; Koonin, E.; and Mironov, A. 2000. Prediction of transcription regulatory sites in archaea by a comparative genomic approach. Nucleic Acids Research 28 (3) :695-705.
8. Hertz, G., and Stormo, G. 1999. Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics 15:563-577.
9. Jerrum, M. 1992. Large cliques elude the Metropolis process. Random Structures and Algorithms 3 (4) :347-359.
10. Kelly, T., and Smith, H. 1970. A restriction enzyme from Hemophilus influenzae. II. Journal of Molecular Biology 51:393-409.
11. Lawrence, C.; Altschul, S.; Boguski, M.; Liu, J.; Neuwald, A.; and Wootton, J. 1993. Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment. Science 262:208-214.
12. Li, M.; Ma, B.; and Wang, L. 1999. Finding similar regions in many strings. In Proceedings of the 31st ACM Annual Symposium on Theory of Computing, 473-482.
13. Neuwald, A.; Liu, J.; and Lawrence, C 1995. Gibbs motif sampling: detection of bacterial outer membrane protein repeats. Protein Science 4 (8) :1618-1632.
14. Pesole, G.; Prunella, N.; Liuni, S.; Attimonelli, M.; and Saccone, C. 1992. WORDUP: an efficient algorithm for discovering statistically significant patterns in DNA sequences. Nucleic Acids Research 20 (11) :2871-2875.
15. Rigoutsos, I., and Floratos, A. 1998. Combinatorial pattern discovery in biological sequences. Bioinformatics 14:55-67.
16. Rocke, E., and Tompa, M. 1998. An algorithm for finding novel gapped motifs in DNA sequences. In Istrail, S.; Pevzner, P.; and Waterman, M., eds., Proceedings of the Second Annual International Conference on Computational Molecular Biology (RECOMB-98), 228-233. New York, New York: ACM Press.
17. Roytberg, M. 1992. A search for common pattern in many sequences. Computer Applications in Biosciences 8:57-64.
18. Staden, R. 1989. Methods for discovering novel motifs in nucleic acid sequences. Computer Applications in Biosciences 5 (4) :293-298.
19. Stormo, G., and Hartzell III, G. 1989. Identifying protein-binding sites from unaligned DNA fragments. Proceedings of the National Academy of Sciences USA 86:1183-1187.
20. Tompa, M. 1999. An exact method for finding short motifs in sequences with application to the Ribosome Binding Site problem. In Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology, 262-271. Heidelberg, Germany: AAAI Press.
21. van Helden, J.; Andre, B., and Collado-Vides, J. 1998. Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies. Journal of Molecular Biology 281 (5) :827-842.
22. Vihinen, M. 1988. An algorithm for simultaneous comparison of several sequences. Computer Applications in Biosciences 4:89-92.
23. Vingron, M., and Argos, P. 1991. Motif recognition and alignment for many sequences by comparison of dot-matrices. Journal of Molecular Biology 218:33-43.
24. Vingron, M., and Pevzner, P. 1995. Multiple sequence comparison and consistency on multipartite graphs. Advances in Applied Mathematics 16:1-22.
25. Wolfertstetter, F.; Frech, K.; Herrmann, G.; and Werner, T. 1996. Identification of functional elements in unaligned nucleic acid sequences by a novel tuple search algorithm. Computer Applications in Biosciences 12 (1) :71-80.
26. Workman, C., and Stormo, G. 2000. ANN-SPEC: a method for discovering transcription factor binding sites with improved specificity. In Pacific Symposium of Biocomputing, volume 5, 464-475.