Sparse markov chains for sequence data

Scandinavian Journal of Statistics

Volumn 41, Issue 3, 2014, Pages 639-655

  Jääskinen, Väinö ^a   Xiong, Jie ^a   Corander, Jukka ^a,b   Koski, Timo ^c  

^a UNIVERSITY OF HELSINKI   (Finland)

^b ÅBO AKADEMI UNIVERSITY   (Finland)

^c ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Bayesian learning; Data compression; Markov chains; Predictive inference; Variable order Markov models

Indexed keywords

EID: 84905718060     PISSN: 03036898     EISSN: 14679469     Source Type: Journal    
DOI: 10.1111/sjos.12053     Document Type: Article

References (35)

1. Bacallado, S. (2011). Bayesian analysis of variable-order, reversible Markov chains. Ann. Stat. 39, 838-864.
2. Begleiter, R., El-Yaniv, R. & Yona, G. (2004). On prediction using variable order Markov models. J. Artif. Intell. Res. 22, 385-421.
3. Ben-Gal, I., Shani, A., Gohr, A., Grau, J., Arviv, S., Shmilovici, A., Posch, S., Grosse, I. & Journals, O. (2005). Identification of transcription factor binding sites with variable-order Bayesian networks. Bioinformatics 21, 2657-2666.
4. Browning, S.R. (2006). Multilocus association mapping using variable-length Markov chains. Am. J. Hum. Genet. 78, 903-913.
5. Bühlmann, P. & Wyner, A.J. (1999). Variable length Markov chains. Ann. Stat. 27, 480-513.
6. Corander, J., Waldmann, P., Marttinen, P. & Sillanpää, M.J. (2003). Bayesian analysis of genetic differentiation between populations. Genetics 163, 367-374.
7. Corander, J. & Marttinen, P. (2006). Bayesian identification of admixture events using multi-locus molecular markers. Mol. Ecol. 15, 2833-2843.
8. Corander, J., Gyllenberg, M. & Koski, T. (2006). Bayesian model learning based on a parallel MCMC strategy. Stat. Comput. 16, 355-362.
9. Corander, J., Ekdahl, M. & Koski, T. (2008). Parallell interacting MCMC for learning of topologies of graphical models. Data Min. Knowl. Disc. 17, 431-456.
10. Corander, J., Ekdahl, M. & Koski, T. (2009). Bayesian unsupervised learning of DNA regulatory binding regions. Adv. Art. Int. Vol. 2009, 11, Article ID 219743. DOI:10.1155/2009/219743.
11. Corander, J., Connor, T.R., O'Dwyner, C.A., Kroll, J.S. & Hanake, W.P. (2012). Population structure in the Neisseria, and the biological significance of fuzzy species. J. R. Soc. Interface 9(71), 1208-1215.
12. Csiszár, I. & Shields, P.C. (2000). The consistency of the BIC Markov order estimator. Ann. Stat. 28, 1601-1619.
13. Csiszár, I. & Talata, Z. (2006). Context tree estimation for not necessarily finite memory processes via BIC and MDL. IEEE Trans. Inf. Theory 52, 1007-1016.
14. Dawson, K.J. & Belkhir, K. (2001). A Bayesian approach to the identification of panmictic populations and the assignment of individuals. Genet. Res., Camb. 78, 59-77.
15. Dimitrakakis, C. (2010a). Bayesian variable order Markov models. Proceedings of the 13th International Conference on Artificial Intelligence and Statistics (AISTATS-10), 9, 161-168, Chia Laguna Resort, Sardinia, Italy.
16. Dimitrakakis, C. (2010b). Context models on sequences of covers. arXiv preprint arXiv:1005.2263.
17. Farcomeni, A. (2011). Hidden Markov partition models. Stat. Probabil. Lett. 81, 1766-1770.
18. Gasthaus, J., Wood, F. & Teh, Y.W. (2010). Lossless compression based on the sequence memoizer. In Data Compression Conference, 337-345, Utah, USA.
19. García, J.E. & González-López, J.E. (2010). Minimal Markov models. arXiv preprint arXiv:1002.0729.
20. Koski, T. (2001). Hidden Markov models for bioinformatics, Kluwer, Dordrecht.
21. MacKay, D.J.C. & Peto, L. (1995). A hierarchical Dirichlet language model. Nat. Lang. Eng. 1, 1-19.
22. Mardia, K.V., Kent, J.T. & Bibby, J.M. (1979). Multivariate analysis, Academic Press, London.
23. Marttinen, P., Corander, J., Törönen, P. & Holm, L. (2006). Bayesian search of functionally divergent protein subgroups and their function specific residues. Bioinformatics 22, (20), 2466-2474.
24. Marttinen, P., Myllykangas, S. & Corander, J. (2009). Bayesian clustering and feature selection for cancer tissue samples. BMC Bioinformatics 10, 90.
25. Mächler, M. & Bühlmann, P. (2004). Variable length Markov chains: methodology, computing, and software. J. Comput. Graph. Stat. 13, 435-455.
26. Neal, R.M. (2000). Markov chain sampling methods for Dirichlet process mixture models. J. Comp. Graph. Stat. 9, 249-265.
27. Rissanen, J. (1983). A universal data compression system. IEEE Trans. Inf. Theory 29, 656-664.
28. Roos, T. & Yu, B. (2009). Sparse Markov source estimation via transformed Lasso. In Proceedings of the IEEE Information Theory Workshop (ITW-2009), 241-245, Taormina, Sicily, Italy.
29. Saraiva, E.F. & Milan, L.A. (2012). Clustering gene expression data using a posterior split-merge-birth procedure. Scand. J. Stat. 39, 399-415.
30. Tu, Z. & Zhu, S.C. (2002). Image segmentation by data-driven Markov chain Monte Carlo. IEEE Trans. Pattern Anal. Mach. Intell. 24, 657-673.
31. Weinberger, M.J., Rissanen, J. & Feder, M.Ž. (1995). A universal finite memory source. IEEE Trans. Inf. Theory 41, 643-652.
32. Willems, F.M.J., Shtarkov, Y.M. & Tjalkens, T.J. (1995). The context tree weighting method: basic properties. IEEE Trans. Inf. Theory 41, 653-664.
33. Wong, W.H. & Ma, L. (2010). Optional Pólya tree and Bayesian inference. The Ann. Stat. 38, 1433-1459.
34. Wood, F., Archambeau, C., Gasthaus, J., James, L. & Teh, Y.W. (2009). A stochastic memoizer for sequence data. In Proceedings of the 26th Annual International Conference on Machine Learning, 1129-1136, Montreal, QC, Canada.
35. Zhang, X., Huang, H., Li, M. & Speed, T. (2005). Finding short DNA motifs using permuted Markov models. Bioinformatics 21, 894-906.