Finding subtle motifs by branching from sample strings

Bioinformatics

Volumn 19, Issue SUPPL. 2, 2003, Pages

  Price, Alkes ^a   Ramabhadran, Sriram ^a   Pevzner, Pavel A ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

METALLOTHIONEIN; PREPROINSULIN; PROTEIN C FOS;

ALGORITHM; CONFERENCE PAPER; GENETIC ENGINEERING; MUTATION; NONHUMAN; NUCLEOTIDE SEQUENCE; ONCOGENE C FOS; PRIORITY JOURNAL; PROMOTER REGION; QUALITY CONTROL; YEAST;

EID: 2342476143     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/btg1072     Document Type: Conference Paper

References (20)

1. Apostolico, A., Bock, M. and Lonardi, S. (2002) Monotony of surprise and large-scale quest for unusual words. Proceedings of the Sixth Annual International Conference on Research in Computational Molecular Biology (RECOMB-02). ACM Press, Washington, DC, pp. 22-31.
2. Bailey, T. and Elkan, C. (1994) Fitting a mixture model by expectation maximization to discover motifs in biopolymers. Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology (ISMB-94). AAAI Press, Menlo Park, CA, pp. 28-36.
3. Bailey, T. and Elkan, C. (1995) The value of prior knowledge in discovering motifs with MEME. Proceedings of the Third International Conference on Intelligent Systems for Molecular Biology (ISMB-95). AAAI Press, Cambridge, England, pp. 21-29.
4. Blanchette, M. (2001) Algorithms for phylogenetic footprinting. Proceedings of the Fifth Annual International Conference on Research in Computational Molecular Biology (RECOMB-01). ACM Press, Montreal, Canada, pp. 49-58.
5. Buhler, J. (2001) Search Algorithms for Biosequences Using Random Projection, Ph.D. Thesis, University of Washinton.
6. Buhler, J. and Tompa, M. (2001) Finding motifs using random projections. Proceedings of the Fifth Annual International Conference on Research in Computational Molecular Biology (RECOMB-01). ACM Press, Montreal, Canada, pp. 69-76.
7. Eskin, E. and Pevzner, P. (2002) Finding composite regulatory patterns in DNA sequences. Bioinformatics, Proceedings of the Tenth International Conference on Intelligent Systems for Molecular Biology(ISMB-02), S1, pp. 354-363.
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. Hertz, G. and Stormo, G. (1999) Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics, 15, 563-577.
10. Keich, U. and Pevzner, P. (2002a) Finding motifs in the twilight zone. Bioinformatics, 18, 1374-1381.
11. Keich, U. and Pevzner, P. (2002b) Subtle motifs: defining the limits of motif finding algorithms. Bioinformatics, 18, 1382-1390.
12. 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.
13. Marsan, L. and Sagot, M. (2000) Algorithms for extracting structured motifs using a suffix tree with an application to promoter and regulatory site consensus identification. J. Comput. Biol., 7(3-4), 345-362.
14. Pavesi, G., Mauri, G. and Pesole, G. (2001) An algorithm for finding signals of unknown length in DNA sequences. Bioinformatics, Proceedings of the Ninth International Conference on Intelligent Systems for Molecular Biology (ISMB-01), S1, pp. 207-214.
15. Pevzner, P. and Sze, S. (2000) Combinatorial approaches to finding subtle signals in DNA sequences. Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology (ISMB-OO). AAAI Press, San Diego, California, pp. 269-278.
16. Sagot, M. (1998) Spelling approximate or repeated motifs using a suffix tree. Lecture Notes in Computer Science, 1380, 111-127.
17. Sagot, M., Escalier, V., Viari, A. and Soldano, H. (1995) Searching for repeated words in a text allowing for mismatches and gaps. Proceedings of the Second South American Workshop on String Processing. Valparaiso, Chile, pp. 87-100.
18. Stormo, G. and Hartzell III, G. (1989) Identifying protein-binding sites from unaligned DNA fragments. Proc. Natl Acad. Sci. USA, 86, 1183-1187.
19. Vanet, A., Marsan, L., Labigne, A. and Sagot, M. (2000) Inferring regulatory elements from a whole genome. An analysis of Helicobacter pylori sigma(80) family of promoter signals. J. Mol. Biol., 297(2), 335-353.
20. Waterman, M., Arratia, R. and Galas, E. (1984) Pattern recognition in several sequences: consensus and alignment. Bull. Math. Biol., 46, 515-527.