Efficient exact motif discovery

Bioinformatics

Volumn 25, Issue 12, 2009, Pages

  Marschall, Tobias ^a   Rahmann, Sven ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BACTERIAL PROTEIN;

ACCESS TO INFORMATION; ACCURACY; COMPUTER PROGRAM; CONFERENCE PAPER; CONTROLLED STUDY; HIDDEN MARKOV MODEL; INTERMETHOD COMPARISON; INTERNET; MATHEMATICAL ANALYSIS; MYCOBACTERIUM TUBERCULOSIS; NUCLEOTIDE SEQUENCE; PRIORITY JOURNAL; PROBABILITY; PROTEIN MOTIF; SEQUENCE ANALYSIS;

ALGORITHMS; COMPUTATIONAL BIOLOGY; MARKOV CHAINS; MYCOBACTERIUM TUBERCULOSIS; PROBABILITY; SEQUENCE ANALYSIS;

MYCOBACTERIUM TUBERCULOSIS;

EID: 66349110658     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btp188     Document Type: Conference Paper

References (26)

1. Bailey,T.L. and Elkan,C. (1994) Fitting amixture model by expectation maximization to discover motifs in biopolymer. In Altman,R.B. et al. (eds) Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology (ISMB), AAAI Press, pp. 28-36.
2. Boeva,V. et al. (2007) Exact P-value calculation for heterotypic clusters of regulatory motifs and its application in computational annotation of cis-regulatory modules. Algorithm Mol. Biol., 2 13.
3. Brémaud,P. (1999) Markov Chains. Springer, Berlin.
4. Durbin,R. et al. (1998) Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, Cambridge, UK.
5. Ettwiller,L. et al. (2005) The discovery, positioning and verification of a set of transcription-associated motifs in vertebrates. Genome Biol., 6, R104.
6. Fauteux,F. et al. (2008) Seeder: Discriminative seeding DNA motif discovery. Bioinformatics, 24, 2303-2307.
7. Fratkin,E. et al. (2006) MotifCut: Regulatory motifs finding with maximum density subgraphs. Bioinformatics, 22, e150-e157.
8. Hannenhalli,S. (2008) Eukaryotic transcription factor binding sites-modeling and integrative search methods. Bioinformatics, 24, 1325-1331.
9. Li,N. and Tompa,M. (2006) Analysis of computational approaches for motif discovery. Algorithms Mol. Biol., 1, 8.
10. Lladser,M. et al. (2008) Multiple pattern matching: A Markov chain approach. J. Math. Biol., 56, 51-92.
11. Marschall,T. and Rahmann,S. (2008) Probabilistic arithmetic automata and their application to pattern matching statistics. In Ferragina,P. and Landau,G.M. (eds), Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching (CPM), Vol. 5029 of Lecture Notes in Computer Science, Springer, Heidelberg, pp. 95-106.
12. Nicodème,P. et al. (2002) Motif statistics. Theor. Comput. Sci., 287, 593-617.
13. Nuel,G. (2008) Pattern Markov chains: Optimal Markov chain embedding through deterministic finite automata. J. Appl. Probab., 45, 226-243.
14. Pavesi,G. et al. (2004) Weeder Web: Discovery of transcription factor binding sites in a set of sequences from co-regulated genes. Nucleic Acids Res., 32, W199-W203.
15. Régnier,M. (2000) A unifed approach to word occurrence probabilities. Discrete Appl. Math., 104, 259-280.
16. Reinert,G. et al. (2000) Probabilistic and statistical properties of words: An overview. J. Comput. Biol., 7, 1-46.
17. Robin,S. et al. (2005) DNA, Words and Models. Statistics of Exceptional Words. Cambridge University Press, Cambridge, UK.
18. Roquain,E. and Schbath,S. (2007). Improved compound Poisson approximation for the number of occurrences of multiple words in a stationary Markov chain. Adv. Appl. Prob., 39, 128-140.
19. Sagot,M.-F. (1998) Spelling approximate repeated or commonmotifs using a suffix tree. In LATIN '98: Proceedings of the Third Latin American Symposium on Theoretical Informatics, LNCS 1380, Springer, London, UK, pp. 374-390.
20. Sandve,G. and Drabløs,F. (2006). A survey of motif discovery methods in an integrated framework. Biol. Direct, 1, 11.
21. Sandve,G. et al. (2007) Improved benchmarks for computational motif discovery. BMC Bioinformatics, 8, 193.
22. Schbath,S. (1995) Compound poisson approximation of word counts in DNA sequences. ESAIM: Prob. Stat., 1, 1-16.
23. Sinha,S. and Tompa,M. (2003) YMF: A program for discovery of novel transcription factor binding sites by statistical overrepresentation. Nucleic Acids Res., 31, 3586-3588.
24. Stefanov,V. et al. (2007) Waiting times for clumps of patterns and for structured motifs in random sequences. Discrete Appl. Math., 155, 868-880.
25. Tompa,M. et al. (2005) Assessing computational tools for the discovery of transcription factor binding sites. Nat. Biotechnol., 23, 137-144.
26. Waterman,M.S. (1995) Introduction to Computational Biology: Maps, Sequences and Genomes. Chapman & Hall/CRC, Boca Raton.