Efficient representation and P-value computation for high-order Markov motifs

Bioinformatics

Volumn 24, Issue 16, 2008, Pages

  da Fonseca, Paulo G S ^a,b,c   Guimarães, Katia S ^b,c   Sagot, Marie France ^b,c  

^a FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

^b UNIVERSITÉ LYON 1   (France)

^c LABORATOIRE DE BIOMÉTRIE ET BIOLOGIE EVOLUTIVE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL MODEL; COMPUTER PROGRAM; CONFERENCE PAPER; GENE SEQUENCE; GENETIC ALGORITHM; GENETIC ANALYSIS; MATHEMATICAL COMPUTING; PRIORITY JOURNAL; PROBABILITY; STATISTICAL SIGNIFICANCE;

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

References (17)

1. Bailey,T.L. and Elkan,C. (1994) Fitting a mixture model by expectation maximization to discover motifs in biopolymers. Proc. Int. Conf. Intell. Syst. Mol. Biol., 2, 28-36.
2. Barash,Y. et al. (2003) Modeling dependencies in protein-DNA binding sites. In Proceedings of the Seventh Annual International Conference on Research in Computational Molecular Biology (RECOMB'03) ACM, New York, NY, USA, pp. 28-37.
3. Beckstette,M. et al. (2006) Fast index based algorithms and software for matching position specific scoring matrices. BMC Bioinformatics, 7, 389.
4. Bejerano,G. (2003) Efficient exact P-value computation and applications to biosequence analysis. In Proceedings of the Seventh Annual International Conference on Research in Computational Molecular Biology (RECOMB'03). ACM, New York, NY, USA, pp. 38-47.
5. Durbin,R. et al. (1999) Biological sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, Cambridge, UK.
6. Ellrott,K. et al. (2002) Identifying transcription factor binding sites through markov chain optimization. Bioinformatics, 18 (Suppl 2), S100-S109.
7. Fredkin,E. (1960) The memory. Comm. ACM, 3, 490-499.
8. Guha Thakurta,D. (2006) Computational identification of transcriptional regulatory elements in DNA sequence. Nucleic Acids Res., 34, 3585-3598.
9. Huang,W. et al. (2006) Optimized mixed markov models for motif identification. BMC Bioinformatics, 7, 279.
10. Knuth,D.E. (1998) Sorting and searching. In The Art of Computer Programming, vol. 3 of The Art of Computer Programming. 2nd edn. Addison, Reading, MA, USA.
11. Lawrence,C.E. et al. (1993) Detecting subtle sequence signals: A Gibbs sampling strategy for multiple alignment. Science, 262 208-214.
12. Michalewicz,Z. and Fogel,D. (2004) How to Solve it: Modern Heuristics Springer, Berlin, Germany.
13. Pizzi,C. et al. (2007) Fast search algorithms for position specific scoring matrices. In Proceedings of the Bioinformatics Research and Development BIRD 2007, vol. 4414 of Lecture Notes in Bioinformatics. Springer, Berlin, Germany, pp. 239-250.
14. Touzet,H. and Varre,J.-S. (2007) Efficient and accurate P-value computation for position weight matrices. Algorithms Mol. Biol., 2, 15.
15. Wingender,E. et al (2000) Transfac: An integrated system for gene expression regulation. Nucleic Acids Res., 28, 316-319.
16. Zhang,J. et al. (2007) Computing exact P-values for DNA motifs. Bioinformatics, 23, 531-537.
17. Zhao,X. et al. (2005) Finding short DNA motifs using permuted markov models. J. Comput. Biol., 12, 894-906.