Evidence map›Paper›PMID 34252951›Full record

ArticleBioinformatics (Oxford, England)2021

Advancing admixture graph estimation via maximum likelihood network orientation.

Erin K Molloy, Arun Durvasula, Sriram Sankararaman

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 19 papers.

0numbers the graph read from it
0cells of the map it votes in
19citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

19 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Leveraging graphical model techniques to study evolution on phylogenetic networks.Philosophical transactions of the Royal Society of London. Series B, Biological sciences · 2025
    Review
  8. Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Erin K MolloyDepartment of Computer Science, University of California, Los Angeles, LA 90095, USA.
Arun DurvasulaDepartment of Human Genetics, David Geffen School of Medicine, University of California, Los Angeles, LA 90095, USA.
Sriram SankararamanDepartment of Computer Science, University of California, Los Angeles, LA 90095, USA.

Funding

Statistical Models for Dissecting Human Population Admixture and its Role in Evolution and DiseaseR35GM125055 · NIGMS · UNIVERSITY OF CALIFORNIA LOS ANGELES · PI SANKARARAMAN, SRIRAM · 2017 to 2021
$1.6M
Alfred P. Sloan Research FellowshipNIGMS NIH HHS R35 GM125055NSF GRFP DGE-1650604
6 · The paper itself

Abstract

motivationAdmixture, 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.

resultsHere, 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.

Indexed as

AlgorithmsSoftwareHumansLikelihood FunctionsPhylogenyPopulation Groups

Identifiers

PMID34252951
PMCPMC8336447

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.