Evidence map›Paper›PMID 36789293›Full record

ArticleBioinformatics advances2023

DISCO+QR: rooting species trees in the presence of GDL and ILS.

James Willson, Yasamin Tabatabaee, Baqiao Liu, Tandy Warnow

Abstract read
In one paragraph

Article in Bioinformatics advances, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

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

1 citing paper in PubMed.

  1. 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

4 authors.

James WillsonDepartment of Computer Science, University of Illinois Urbana-Champaign, Urbana, IL 61801, USA.ORCID https://orcid.org/0000-0002-8496-3597
Yasamin TabatabaeeDepartment of Computer Science, University of Illinois Urbana-Champaign, Urbana, IL 61801, USA.ORCID https://orcid.org/0000-0002-7811-5989
Baqiao LiuDepartment of Computer Science, University of Illinois Urbana-Champaign, Urbana, IL 61801, USA.ORCID https://orcid.org/0000-0002-4210-8269
Tandy WarnowDepartment of Computer Science, University of Illinois Urbana-Champaign, Urbana, IL 61801, USA.ORCID https://orcid.org/0000-0001-7717-3514

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Motivation: Genes evolve under processes such as gene duplication and loss (GDL), so that gene family trees are multi-copy, as well as incomplete lineage sorting (ILS); both processes produce gene trees that differ from the species tree. The estimation of species trees from sets of gene family trees is challenging, and the estimation of rooted species trees presents additional analytical challenges. Two of the methods developed for this problem are STRIDE, which roots species trees by considering GDL events, and Quintet Rooting (QR), which roots species trees by considering ILS. Results: We present DISCO+QR, a new approach to rooting species trees that first uses DISCO to address GDL and then uses QR to perform rooting in the presence of ILS. DISCO+QR operates by taking the input gene family trees and decomposing them into single-copy trees using DISCO and then roots the given species tree using the information in the single-copy gene trees using QR. We show that the relative accuracy of STRIDE and DISCO+QR depend on the properties of the dataset (number of species, genes, rate of gene duplication, degree of ILS and gene tree estimation error), and that each provides advantages over the other under some conditions. Availability and implementation: DISCO and QR are available in github. Supplementary information: Supplementary data are available at

Identifiers

PMID36789293
PMCPMC9923442

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.