Cargando…

Estimating Effective Population Size from Temporally Spaced Samples with a Novel, Efficient Maximum-Likelihood Algorithm

The effective population size [Formula: see text] is a key parameter in population genetics and evolutionary biology, as it quantifies the expected distribution of changes in allele frequency due to genetic drift. Several methods of estimating [Formula: see text] have been described, the most direct...

Descripción completa

Detalles Bibliográficos
Autores principales: Hui, Tin-Yu J., Burt, Austin
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Genetics Society of America 2015
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4423369/
https://www.ncbi.nlm.nih.gov/pubmed/25747459
http://dx.doi.org/10.1534/genetics.115.174904
_version_ 1782370203365015552
author Hui, Tin-Yu J.
Burt, Austin
author_facet Hui, Tin-Yu J.
Burt, Austin
author_sort Hui, Tin-Yu J.
collection PubMed
description The effective population size [Formula: see text] is a key parameter in population genetics and evolutionary biology, as it quantifies the expected distribution of changes in allele frequency due to genetic drift. Several methods of estimating [Formula: see text] have been described, the most direct of which uses allele frequencies measured at two or more time points. A new likelihood-based estimator [Formula: see text] for contemporary effective population size using temporal data is developed in this article. The existing likelihood methods are computationally intensive and unable to handle the case when the underlying [Formula: see text] is large. This article tries to work around this problem by using a hidden Markov algorithm and applying continuous approximations to allele frequencies and transition probabilities. Extensive simulations are run to evaluate the performance of the proposed estimator [Formula: see text] , and the results show that it is more accurate and has lower variance than previous methods. The new estimator also reduces the computational time by at least 1000-fold and relaxes the upper bound of [Formula: see text] to several million, hence allowing the estimation of larger [Formula: see text]. Finally, we demonstrate how this algorithm can cope with nonconstant [Formula: see text] scenarios and be used as a likelihood-ratio test to test for the equality of [Formula: see text] throughout the sampling horizon. An R package “NB” is now available for download to implement the method described in this article.
format Online
Article
Text
id pubmed-4423369
institution National Center for Biotechnology Information
language English
publishDate 2015
publisher Genetics Society of America
record_format MEDLINE/PubMed
spelling pubmed-44233692015-05-08 Estimating Effective Population Size from Temporally Spaced Samples with a Novel, Efficient Maximum-Likelihood Algorithm Hui, Tin-Yu J. Burt, Austin Genetics Investigations The effective population size [Formula: see text] is a key parameter in population genetics and evolutionary biology, as it quantifies the expected distribution of changes in allele frequency due to genetic drift. Several methods of estimating [Formula: see text] have been described, the most direct of which uses allele frequencies measured at two or more time points. A new likelihood-based estimator [Formula: see text] for contemporary effective population size using temporal data is developed in this article. The existing likelihood methods are computationally intensive and unable to handle the case when the underlying [Formula: see text] is large. This article tries to work around this problem by using a hidden Markov algorithm and applying continuous approximations to allele frequencies and transition probabilities. Extensive simulations are run to evaluate the performance of the proposed estimator [Formula: see text] , and the results show that it is more accurate and has lower variance than previous methods. The new estimator also reduces the computational time by at least 1000-fold and relaxes the upper bound of [Formula: see text] to several million, hence allowing the estimation of larger [Formula: see text]. Finally, we demonstrate how this algorithm can cope with nonconstant [Formula: see text] scenarios and be used as a likelihood-ratio test to test for the equality of [Formula: see text] throughout the sampling horizon. An R package “NB” is now available for download to implement the method described in this article. Genetics Society of America 2015-05 2015-03-05 /pmc/articles/PMC4423369/ /pubmed/25747459 http://dx.doi.org/10.1534/genetics.115.174904 Text en Copyright © 2015 by the Genetics Society of America Available freely online through the author-supported open access option.
spellingShingle Investigations
Hui, Tin-Yu J.
Burt, Austin
Estimating Effective Population Size from Temporally Spaced Samples with a Novel, Efficient Maximum-Likelihood Algorithm
title Estimating Effective Population Size from Temporally Spaced Samples with a Novel, Efficient Maximum-Likelihood Algorithm
title_full Estimating Effective Population Size from Temporally Spaced Samples with a Novel, Efficient Maximum-Likelihood Algorithm
title_fullStr Estimating Effective Population Size from Temporally Spaced Samples with a Novel, Efficient Maximum-Likelihood Algorithm
title_full_unstemmed Estimating Effective Population Size from Temporally Spaced Samples with a Novel, Efficient Maximum-Likelihood Algorithm
title_short Estimating Effective Population Size from Temporally Spaced Samples with a Novel, Efficient Maximum-Likelihood Algorithm
title_sort estimating effective population size from temporally spaced samples with a novel, efficient maximum-likelihood algorithm
topic Investigations
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4423369/
https://www.ncbi.nlm.nih.gov/pubmed/25747459
http://dx.doi.org/10.1534/genetics.115.174904
work_keys_str_mv AT huitinyuj estimatingeffectivepopulationsizefromtemporallyspacedsampleswithanovelefficientmaximumlikelihoodalgorithm
AT burtaustin estimatingeffectivepopulationsizefromtemporallyspacedsampleswithanovelefficientmaximumlikelihoodalgorithm