Finding short DNA motifs using permuted Markov models

Proceedings of the Annual International Conference on Computational Molecular Biology, RECOMB

Volumn 8, Issue , 2004, Pages 68-75

  Zhao, Xiaoyue ^a   Huang, Haiyan ^a   Speed, Terence P ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b WALTER AND ELIZA HALL INSTITUTE OF MEDICAL RESEARCH   (Australia)

Author keywords

Jeffreys mixture; Maximal dependence decomposition; Model selection; Permuted variable length Markov models; Splice sites; Transcription factor binding sites; Weight matrix models

Indexed keywords

ALGORITHMS; DNA; GENETIC ENGINEERING; MARKOV PROCESSES; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBABILITY; PROTEINS;

MARKOV MODELS; MAXIMUM DEPENDENCE DECOMPOSITION; MODEL SELECTION; PERMUTED VARIABLE LENGTH; SPLICE SITES; TRANSCRIPTION FACTOR BINDING SITES; WEIGHT MATRIX MODELS;

COMPUTER SCIENCE;

EID: 2442478445     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/974614.974624     Document Type: Conference Paper

References (30)

1. H. Akaike. A new look at the statistical model identification. IEEE Trans. on Auto. Control, 19(6):716-723, 1974.
2. M. Alexandersson, S. Cawley, and L. Pachter. SLAM: cross-species gene finding and alignment with a generalized pair hidden Markov model. Genome Research, 13:496-502, 2003.
3. Y. Barash, G. Elidan, N. Friedman, and T. Kaplan. Modeling dependencies in protein-DNA binding sites. In RECOMB'03, 2003.
4. A. Barron, J. Rissanen, and B. Yu. The minimum description length principle in coding and modeling. IEEE Trans. on Inform. Theory, 44(6):2743-2760, 1998.
5. S. Batzoglou, L. Pachter, J. P. Mesirov, B. Berger, and E. S. Lander. Human and mouse gene structure: comparative analysis and application to exon prediction. Genome Research, 10(7):950-958, 2000.
6. P. Bühlmann and A. J. Wyner. Model selection for variable length Markov chains and tuning the context algorithm. Annals of the Institute of Statistical Mathematics, 52(2):287-315, 2000.
7. L. Breiman, J. Friedman, R. Olshen, and C. Stone. Classification and regression trees. Belmont, Calif.: Wadsworth International Group, 1984.
8. C. Burge and S. Karlin. Prediction of complete gene structures in human genomic DNA. Journal of Molecular Biology, 268:78-94, 1997.
9. M. Burset, I. A. Seledtsov, and V. V. Solovyev. SpliceDB: database of canonical and non-canonical mammalian splice sites. Nucleic Acids Research, 29(1):255-259, 2001.
10. D. Cai, A. Delcher, B. Kao, and S. Kasif. Modeling splice sites with Bayes networks. Bioinformatics, 16(2):152-158, 2000.
11. S. Cawley. Statistical models for DNA sequencing and analysis. In PhD thesis. University of California at Berkeley. Berkeley, CA, 2000.
12. H. Chipman, E. I. George, and R. E. McCulloch. Bayesian CART model search. Journal of the American Statistical Association, 93:935-960, 1998.
13. K. Ellrott, C. Yang, F. M. Sladek, and T. Jiang. Identifying transcription factor binding sites through Markov chain optimization. Bioinformatics, 18:s100-109, 2002.
14. W. Fairbrother and L. Chasin. Human genomic sequences that inhibit splicing. Molecular and Cell Biology, 20(18):6816-6825, 2000.
15. W. Fairbrother, R. Yeh, P. Sharp, and C. Burge. Predictive identification of exonic splicing enhancers in human genes. Science, 297(5583):1007-13, 2002.
16. P. J. Green. Reversible jump Markov chain Monte Carlo computation and Bayesian model determination. Biometrika, 82(4):711-732, 1995.
17. H. Huang, M. J. Kao, X. Zhou, J. S. Liu, and W. H. Wong. Determination of local statistical significance of patterns in Markov sequences with application to promoter element identification. Journal of Computational Biology, 11(1), 2004.
18. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science. 220(4598):671-680, 1983.
19. L. Pachter, M. Alexandersson, and S. Cawley. Applications of generalized pair hidden Markov models to alignment and gene finding problems. Journal of Computational Biology, 9:389-399, 2002.
20. G. Potamianos and F. Jelinek. A study of n-gram and decision tree letter language modeling methods. Speech Communication, 24:171-192, 1998.
21. M. G. Reese, D. Kulp, H. Tammana, and D. Haussler. Genie-gene finding in Drosophila melanogaster. Genome Research, 10(4):529-538, 2000.
22. J. Rissanen. Complexity of strings in the class of Markov sources. IEEE Trans. Inform. Theory, 32:526-532, 1986.
23. S. L. Salzberg, A. L. Delcher, S. Kasif, and O. White. Microbial gene identification using interpolated Markov models. Nucleic Acids Research, 26(2):544-548, 1998.
24. T. D. Schneider and R. M. Stephens. Sequence logos: a new way to display consensus sequences. Nucleic Acids Research, 18(20):6097-6100, 1990.
25. G. Schwarz. Estimating the dimension of a model. The Annals of Statistics, 6(2):461-464, 1978.
26. R. Staden. Computer methods to locate signals in nucleic acid sequences. Nucleic Acids Research, 12:505-519, 1984.
27. J. P. Staley and C. Guthrie. Mechanical devices of the spliceosome: motors, clocks, springs, and things. Cell, 92:315-326, 1998.
28. E. Wingender, X. Chen, R. Hehl, H. Karas, I. Liebich, V. Matys, T. Meinhardt, M. Pruss, I. Reuter, and F. Schacherer. Transfac: an integrated system for gene expression regulation. Nucleic Acids Research, 28:316-319, 2000.
29. G. Yeo and C. Burge. Maximum entropy modeling of short sequences motifs with applications to RNA splicing signals. In RECOMB'03, 2003.
30. M. Q. Zhang and T. G. Marr. A weight array method for splicing signal analysis. Computer Applications in the Biosciences (CABIOS), 9(5):499-509, 1993.