Faster exact Markovian probability functions for motif occurrences: A DFA-only approach

Bioinformatics

Volumn 24, Issue 24, 2008, Pages 2839-2848

  Ribeca, Paolo ^a   Raineri, Emanuele ^a  

^a CENTRE FOR GENOMIC REGULATION CRG   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

AMINO ACID;

AMINO ACID SEQUENCE; ARTICLE; AUTOMATION; COMPUTER PROGRAM; CONTROLLED STUDY; GENE SEQUENCE; GENETIC ALGORITHM; HIDDEN MARKOV MODEL; HUMAN; MATHEMATICAL COMPUTING; MOLECULAR BIOLOGY; NONHUMAN; PRIORITY JOURNAL; PROBABILITY; PROTEIN ANALYSIS; PROTEIN MOTIF; SEQUENCE ANALYSIS; STATISTICAL ANALYSIS; STATISTICAL SIGNIFICANCE;

EID: 57249116908     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/btn525     Document Type: Article

References (20)

1. Aho,A.V. et al. (2006) Compilers: Principles, Techniques, and Tools. 2nd edn. Addison Wesley.
2. Bailey,T.L. and Elkan,C. (1994) Fitting a mixture model by expectation maximization to discover motifs in biopolymers. In Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology. AAAI Press, Menlo Park, California, pp. 28-36.
3. Ettwiller,L. et al. (2007) Trawler: De novo regulatory motif discovery pipeline for chromatin immunoprecipitation. Nat. Methods 4, 563-565.
4. Frigo,M. and Johnson,S.G. (2005) The design and implementation of FFTW3. Proc. IEEE, 93, 216-231.
5. Graham,R.L. et al. (1994) Concrete Mathematics. Addison-Wesley, Reading, MA.
6. Halpern,D. et al. (2007) Identification of DNA motifs implicated in maintenance of bacterial core genomes by predictive modeling. PLoS Genet., 3, 1614-1621.
7. Krogh,A. et al. (1994) Hidden Markov models in computational biology: Application to protein modeling. J. Mol. Biol., 235 1501-1531.
8. Leroy,X. et al. (2008) Available at http://www.ocaml.org (last accessed date November 7, 2008).
9. Nicodéme,P. et al. (2002) Proteome analysis based on motif statistics. Bioinformatics, 18, S161-S171.
10. Nuel,G. (2006a) Effective P-value computations using finite Markov chain imbedding (FMCI): Application to local score and to pattern statistics. Algorithms Mol. Biol., 1. doi:10.1186/ 1748-7188-1-5.
11. Nuel,G. (2006b) Numerical solutions for pattern statistics on Markov chains. Stat. Appl. Genet. Mol. Biol., 5.
12. Nuel,G. (2007) Pattern Markov chains: Optimal Markov chain embedding through deterministic finite automata. J. Appl. Prob., 45, 226-243.
13. Nuel,G. et al. (2008) Available at http://stat.genopole.cnrs.fr/ spatt (last accessed date November 7, 2008).
14. Press,W.H. et al. (2002) Numerical Recipes in C. Cambridge University Press, Cambridge.
15. Ribeca,P. (2008) Available at http://www.paoloribeca.net/software/ PATRONUS (last accessed date November 7, 2008).
16. Robin,S. et al. (2005) DNA, Words and Models: Statistics of Exceptional Words. Cambridge University Press, Cambridge.
17. Robin,S. et al. (2007) Statistical tests to compare motif count exceptionalities. BMC Bioinformatics, 8.
18. Teixeira,M.C. et al. (2006) The YEASTRACT database: A tool for the analysis of transcription regulatory associations in Saccharomices cerevisiae. Nucleic Acids Res., 34, D444-D451. Available at http://www.yeastract.com (last accessed date November 7, 2008).
19. Wright,M.A. et al. (2007) Chromosomal periodicity of evolutionarily conserved gene pairs. Proc. Natl Acad. Sci. USA, 104, 10559-10564.
20. Zhang,J. et al. (2007) Computing exact P-values for DNA motifs. Bioinformatics, 23, 531-537.