Finding motifs in the twilight zone

Bioinformatics

Volumn 18, Issue 10, 2002, Pages 1374-1381

  Keich, U ^a   Pevzner, P A ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DNA FRAGMENT; TRANSCRIPTION FACTOR; DNA; DNA BINDING PROTEIN;

ALGORITHM; ARTICLE; COMPUTER PROGRAM; CONTROLLED STUDY; DNA SEQUENCE; GENE ACTIVITY; INTERMETHOD COMPARISON; MOLECULAR MODEL; NONHUMAN; PRIORITY JOURNAL; PROTEIN ANALYSIS; PROTEIN BINDING; PROTEIN MOTIF; COMPARATIVE STUDY; CONSENSUS SEQUENCE; ESCHERICHIA COLI; EVALUATION; GENETICS; METABOLISM; METHODOLOGY; MOLECULAR GENETICS; NUCLEOTIDE SEQUENCE; PROMOTER REGION; QUALITY CONTROL; REGULATORY SEQUENCE; SACCHAROMYCES CEREVISIAE; SENSITIVITY AND SPECIFICITY; SEQUENCE ALIGNMENT; VALIDATION STUDY;

ALGORITHMS; AMINO ACID MOTIFS; BASE SEQUENCE; BENCHMARKING; CONSENSUS SEQUENCE; DNA; DNA-BINDING PROTEINS; ESCHERICHIA COLI; MOLECULAR SEQUENCE DATA; PROMOTER REGIONS (GENETICS); QUALITY CONTROL; REGULATORY SEQUENCES, NUCLEIC ACID; SACCHAROMYCES CEREVISIAE; SENSITIVITY AND SPECIFICITY; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA;

EID: 0036772332     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/18.10.1374     Document Type: Article

References (27)

1. Bailey, T and Elkan, C. (1995) Unsupervised learning of multiple motifs in biopolymers using expectation maximization. Machine Learning, 21, 51-80.
2. Blanchette, M. (2001) Algorithms for phylogenetic footprinting. In Proceedings of the Fifth Annual International Conference an Computational Molecular Biology (RECOMB-01). Montréal, Canada.
3. Blanchette, M. and Sinha, S. (2001) Separating real motifs from their artifacts. Bioinformatics, Proceedings of the Ninth International Conference on Intelligent Systems for Molecular Biology. Oxford University Press, Copenhagen, Demnark, pp. S30-S38.
4. Brazma, A., Jonassen, I., Eidhammer I. and Gilbert, D. (1998) Approaches to the automatic discovery of patterns in biosequences. J. Comput. Biol., 5, 279-305.
5. Buhler, J. (2001) Search Algorithms for Biosequences Using Random Projection, Ph.D. thesis, University of Washington.
6. Buhler, J. and Tompa, M. (2001) Finding motifs using random projections. In Proceedings of the Fifth Annual International Conference on Computational Molecular Biology (RECOMB-01). ACM Press, Montreal, CA, pp. 69-76.
7. Fraenkel, Y., Mandel, Y, Friedberg, D. and Margalit, H. (1995) IdentIcation of common motifs in unaligned DNA sequences: application to Escherichia coli Lrp regulon. Comp. Appl. Biosci., 11, 379-387.
8. Galas, D., Eggert, M. and Waterman, M. (1985) Rigorous pattern-recognition methods for DNA sequences. Analysis of promoter sequences from Escherichia coli. J. Mol. Biol., 186, 117-128.
9. Gelfand, M., Koonin, E. and Mironov,A. (2000) Prediction of transcription regulatory sites in Archaea by a comparative genomic approach. Nucleic Acids Res., 28, 695-705.
10. Gribskov, M., McLachlan, M. and Eisenberg, D. (1987) Profile analysis: detection of distantly related proteins. Proc. Natl Acad. Sci. USA, 84, 4355-4358.
11. Hertz, G. and Stormo, G. (1999) Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics, 15, 563-577.
12. Keich, U. and Pevzner, P. (2002) Subtle motifs: defining the limits of motif finding algorithms. Biainformatics, 18, 1382-1390.
13. 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.
14. 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. Atlanta, Georgia, pp. 473-482.
15. 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 Res., 20, 2871-2875.
16. Pevzner, P. and Sze, S. (2000) Combinatorial approaches to finding subtle signals in DNA sequences. In Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology. AAAI Press, San Diego, pp. 269-278.
17. Rigoutsos, I. and Floratos, A. (1998) Combinatorial pattern discovery in biological sequences. Bioinformatics, 14, 55-67.
18. Sagot, M. (1998) Spelling approximate or repeated motifs using a suffix tree. Lecture Notes in Computer Science, 1380, 111-127.
19. Sagot, M., Escalier, V., Viari, A. and Soldano, H. (1995) Searching for repeated words in a text allowing for mismatches and gaps. In Proceedings Second South American Workshop on String Processing. Valparaiso, Chile, pp. 87-100.
20. Staden, R. (1989) Methods for discovering novel motifs in nucleic acid seqences. Comput. Appl. Biosci., 5, 293-298.
21. Stormo, G. (2000) DNA binding sites: representation and discovery. Bioinformatics, 16, 16-23.
22. Stormo, G. and Hartzell III, G. (1989) Identifying protein-binding sites from unaligned DNA fragments. Proc. Natl Acad. Sci. USA, 86, 1183-1187.
23. Sze, S., Gelfand, M. and Pevzner, P. (2002) Finding weak motifs in DNA sequences. In Proceedings of the Pacific Symposium on Biocomputing 2002. pp. 235-246.
24. 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. AAAI Press, Heidelberg, Germany, pp. 262-271.
25. 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. J. Mol. Biol., 281, 827-842.
26. Waterman, M., Arratia, R. and Galas, D. (1984) Pattern recognition in several sequences: consensus and alignment. Bull. Math. Biol., 46, 515-527.
27. Wolfertstetter, F., Frech, K., Herrmann, G. and Werner, T. (1996) Identification of functional elements in unaligned nucleic acid sequences. Comput. Appl. Biosci., 12, 71-80.