Evidence map›Paper›PMID 39102450›Full record

ArticlePLoS computational biology2024

Reliable estimation of tree branch lengths using deep neural networks.

Anton Suvorov, Daniel R Schrider

Abstract read
In one paragraph

Article in PLoS computational biology, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 6 papers.

0numbers the graph read from it
0cells of the map it votes in
6citing 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

6 citing papers in PubMed.

  1. Article
  2. Phylogenetic Methods Meet Deep Learning.Genome biology and evolution · 2025
    Article
  3. Review
  4. Article
  5. Article
  6. AliSim-HPC: parallel sequence simulator for phylogenetics.Bioinformatics (Oxford, England) · 2023
    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

2 authors.

Anton SuvorovDepartment of Biological Sciences, Virginia Tech, Blacksburg, Virginia, United States of America.ORCID 0000-0003-3898-9195
Daniel R SchriderDepartment of Genetics, University of North Carolina at Chapel Hill, Chapel Hill, North Carolina, United States of America.

Funding

Deep learning for population geneticsR01HG010774 · NHGRI · UNIVERSITY OF OREGON · PI ANDREW D KERN · 2020 to 2026
$3.2M
Advancing evolutionary genetics through deep learningR35GM138286 · NIGMS · UNIV OF NORTH CAROLINA CHAPEL HILL · PI DANIEL R SCHRIDER · 2020 to 2026
$2.8M
NHGRI NIH HHS R01 HG010774NIGMS NIH HHS R35 GM138286
6 · The paper itself

Abstract

A phylogenetic tree represents hypothesized evolutionary history for a set of taxa. Besides the branching patterns (i.e., tree topology), phylogenies contain information about the evolutionary distances (i.e. branch lengths) between all taxa in the tree, which include extant taxa (external nodes) and their last common ancestors (internal nodes). During phylogenetic tree inference, the branch lengths are typically co-estimated along with other phylogenetic parameters during tree topology space exploration. There are well-known regions of the branch length parameter space where accurate estimation of phylogenetic trees is especially difficult. Several novel studies have recently demonstrated that machine learning approaches have the potential to help solve phylogenetic problems with greater accuracy and computational efficiency. In this study, as a proof of concept, we sought to explore the possibility of machine learning models to predict branch lengths. To that end, we designed several deep learning frameworks to estimate branch lengths on fixed tree topologies from multiple sequence alignments or its representations. Our results show that deep learning methods can exhibit superior performance in some difficult regions of branch length parameter space. For example, in contrast to maximum likelihood inference, which is typically used for estimating branch lengths, deep learning methods are more efficient and accurate. In general, we find that our neural networks achieve similar accuracy to a Bayesian approach and are the best-performing methods when inferring long branches that are associated with distantly related taxa. Together, our findings represent a next step toward accurate, fast, and reliable phylogenetic inference with machine learning approaches.

Indexed as

Computational BiologyDeep LearningNeural Networks, ComputerPhylogenyAlgorithmsEvolution, MolecularLikelihood FunctionsMachine LearningModels, GeneticSequence Alignment

Identifiers

PMID39102450
PMCPMC11326709

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.