Learning genetic population structures using minimization of stochastic complexity

0Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

Considerable research efforts have been devoted to probabilistic modeling of genetic population structures within the past decade. In particular, a wide spectrum of Bayesian models have been proposed for unlinked molecular marker data from diploid organisms. Here we derive a theoretical framework for learning genetic population structure of a haploid organism from bi-allelic markers for which potential patterns of dependence are a priori unknown and to be explicitly incorporated in the model. Our framework is based on the principle of minimizing stochastic complexity of an unsupervised classification under tree augmented factorization of the predictive data distribution. We discuss a fast implementation of the learning framework using deterministic algorithms. © 2010 by the authors; licensee MDPI Basel, Switzerland.

Cite

CITATION STYLE

APA

Corander, J., Gyllenberg, M., & Koski, T. (2010). Learning genetic population structures using minimization of stochastic complexity. Entropy, 12(5), 1102–1124. https://doi.org/10.3390/e12051102

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free