How Many Subpopulations Is Too Many?: Exponential Lower Bounds for Inferring Population Histories
Author(s)Kim, Younhun; Koehler, Frederic; Moitra, Ankur; Mossel, Elchanan; Ramnarayan, Govind
MetadataShow full item record
Reconstruction of population histories is a central problem in population genetics. Existing coalescent-based methods, like the seminal work of Li and Durbin (Nature, 2011), attempt to solve this problem using sequence data but have no rigorous guarantees. Determining the amount of data needed to correctly reconstruct population histories is a major challenge. Using a variety of tools from information theory, the theory of extremal polynomials, and approximation theory, we prove new sharp information-theoretic lower bounds on the problem of reconstructing population structure—the history of multiple subpopulations that merge, split and change sizes over time. Our lower bounds are exponential in the number of subpopulations, even when reconstructing recent histories. We demonstrate the sharpness of our lower bounds by providing algorithms for distinguishing and learning population histories with matching dependence on the number of subpopulations.
DepartmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Mathematics; MIT Institute for Data, Systems, and Society
Springer International Publishing
Kim, Younhun et al. "How Many Subpopulations Is Too Many?: Exponential Lower Bounds for Inferring Population Histories." International Conference on Research in Computational Molecular Biology, May 2019, Padua Italy, Springer International Publishing, April 2019. © 2019 Springer Nature
Author's final manuscript