Cargando…

Advancing admixture graph estimation via maximum likelihood network orientation

MOTIVATION: Admixture, the interbreeding between previously distinct populations, is a pervasive force in evolution. The evolutionary history of populations in the presence of admixture can be modeled by augmenting phylogenetic trees with additional nodes that represent admixture events. While enabl...

Descripción completa

Detalles Bibliográficos
Autores principales: Molloy, Erin K, Durvasula, Arun, Sankararaman, Sriram
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Oxford University Press 2021
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8336447/
https://www.ncbi.nlm.nih.gov/pubmed/34252951
http://dx.doi.org/10.1093/bioinformatics/btab267
_version_ 1783733321872703488
author Molloy, Erin K
Durvasula, Arun
Sankararaman, Sriram
author_facet Molloy, Erin K
Durvasula, Arun
Sankararaman, Sriram
author_sort Molloy, Erin K
collection PubMed
description MOTIVATION: Admixture, the interbreeding between previously distinct populations, is a pervasive force in evolution. The evolutionary history of populations in the presence of admixture can be modeled by augmenting phylogenetic trees with additional nodes that represent admixture events. While enabling a more faithful representation of evolutionary history, admixture graphs present formidable inferential challenges, and there is an increasing need for methods that are accurate, fully automated and computationally efficient. One key challenge arises from the size of the space of admixture graphs. Given that exhaustively evaluating all admixture graphs can be prohibitively expensive, heuristics have been developed to enable efficient search over this space. One heuristic, implemented in the popular method TreeMix, consists of adding edges to a starting tree while optimizing a suitable objective function. RESULTS: Here, we present a demographic model (with one admixed population incident to a leaf) where TreeMix and any other starting-tree-based maximum likelihood heuristic using its likelihood function is guaranteed to get stuck in a local optimum and return an incorrect network topology. To address this issue, we propose a new search strategy that we term maximum likelihood network orientation (MLNO). We augment TreeMix with an exhaustive search for an MLNO, referring to this approach as OrientAGraph. In evaluations including previously published admixture graphs, OrientAGraph outperformed TreeMix on 4/8 models (there are no differences in the other cases). Overall, OrientAGraph found graphs with higher likelihood scores and topological accuracy while remaining computationally efficient. Lastly, our study reveals several directions for improving maximum likelihood admixture graph estimation. AVAILABILITY AND IMPLEMENTATION: OrientAGraph is available on Github (https://github.com/sriramlab/OrientAGraph) under the GNU General Public License v3.0. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
format Online
Article
Text
id pubmed-8336447
institution National Center for Biotechnology Information
language English
publishDate 2021
publisher Oxford University Press
record_format MEDLINE/PubMed
spelling pubmed-83364472021-08-09 Advancing admixture graph estimation via maximum likelihood network orientation Molloy, Erin K Durvasula, Arun Sankararaman, Sriram Bioinformatics Evolutionary, Comparative and Population Genomics MOTIVATION: Admixture, the interbreeding between previously distinct populations, is a pervasive force in evolution. The evolutionary history of populations in the presence of admixture can be modeled by augmenting phylogenetic trees with additional nodes that represent admixture events. While enabling a more faithful representation of evolutionary history, admixture graphs present formidable inferential challenges, and there is an increasing need for methods that are accurate, fully automated and computationally efficient. One key challenge arises from the size of the space of admixture graphs. Given that exhaustively evaluating all admixture graphs can be prohibitively expensive, heuristics have been developed to enable efficient search over this space. One heuristic, implemented in the popular method TreeMix, consists of adding edges to a starting tree while optimizing a suitable objective function. RESULTS: Here, we present a demographic model (with one admixed population incident to a leaf) where TreeMix and any other starting-tree-based maximum likelihood heuristic using its likelihood function is guaranteed to get stuck in a local optimum and return an incorrect network topology. To address this issue, we propose a new search strategy that we term maximum likelihood network orientation (MLNO). We augment TreeMix with an exhaustive search for an MLNO, referring to this approach as OrientAGraph. In evaluations including previously published admixture graphs, OrientAGraph outperformed TreeMix on 4/8 models (there are no differences in the other cases). Overall, OrientAGraph found graphs with higher likelihood scores and topological accuracy while remaining computationally efficient. Lastly, our study reveals several directions for improving maximum likelihood admixture graph estimation. AVAILABILITY AND IMPLEMENTATION: OrientAGraph is available on Github (https://github.com/sriramlab/OrientAGraph) under the GNU General Public License v3.0. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Oxford University Press 2021-07-12 /pmc/articles/PMC8336447/ /pubmed/34252951 http://dx.doi.org/10.1093/bioinformatics/btab267 Text en © The Author(s) 2021. Published by Oxford University Press. https://creativecommons.org/licenses/by/4.0/This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/ (https://creativecommons.org/licenses/by/4.0/) ), which permits unrestricted reuse, distribution, and reproduction in any medium, provided the original work is properly cited.
spellingShingle Evolutionary, Comparative and Population Genomics
Molloy, Erin K
Durvasula, Arun
Sankararaman, Sriram
Advancing admixture graph estimation via maximum likelihood network orientation
title Advancing admixture graph estimation via maximum likelihood network orientation
title_full Advancing admixture graph estimation via maximum likelihood network orientation
title_fullStr Advancing admixture graph estimation via maximum likelihood network orientation
title_full_unstemmed Advancing admixture graph estimation via maximum likelihood network orientation
title_short Advancing admixture graph estimation via maximum likelihood network orientation
title_sort advancing admixture graph estimation via maximum likelihood network orientation
topic Evolutionary, Comparative and Population Genomics
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8336447/
https://www.ncbi.nlm.nih.gov/pubmed/34252951
http://dx.doi.org/10.1093/bioinformatics/btab267
work_keys_str_mv AT molloyerink advancingadmixturegraphestimationviamaximumlikelihoodnetworkorientation
AT durvasulaarun advancingadmixturegraphestimationviamaximumlikelihoodnetworkorientation
AT sankararamansriram advancingadmixturegraphestimationviamaximumlikelihoodnetworkorientation