Evidence map›Paper›PMID 41709239›Full record

ArticleAlgorithms for molecular biology : AMB2026

Inferring and summarizing tumor phylogenies from bulk DNA data.

Yuanyuan Qi, Henri Schmidt, Mohammed El-Kebir

Abstract read
In one paragraph

Article in Algorithms for molecular biology : AMB, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

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

0 citing papers in PubMed.

No citing paper in PubMed yet.

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.

Yuanyuan QiSiebel School of Computing and Data Science, University of Illinois Urbana-Champaign, Urbana, IL, USA.
Henri SchmidtDepartment of Computer Science, Princeton University, Princeton, NJ, USA.
Mohammed El-KebirSiebel School of Computing and Data Science, University of Illinois Urbana-Champaign, Urbana, IL, USA. melkebir@illinois.edu.

Funding

Division of Computing and Communication Foundations CCF-2046488
6 · The paper itself

Abstract

backgroundCancer phylogenies are key to understanding tumor evolution. However, due to the uncertainty in phylogenetic estimation, one typically infers many, equally-plausible phylogenies from bulk DNA sequencing data of tumors, hindering downstream analysis that relies on correct phylogenies.

resultsTo resolve this challenge, we introduce Sapling, a method to solve two variants of the BACKBONE TREE INFERENCE FROM READS problem, which seeks a small set of backbone trees on a subset of mutations that collectively summarize the space of plausible cancer phylogenies. We prove that the problems are NP-hard.

conclusionsOn simulated and real data, we demonstrate that Sapling is capable of inferring high-quality backbone trees that adequately summarize the space of plausible cancer phylogenies. In addition, we demonstrate that Sapling is able to infer full-size trees with higher likelihoods than state-of-the-art methods.

Indexed as

Convex optimizationDeconvolutionMaximum-agreement subtreesNode-labeled treesPerfect phylogeny

Identifiers

PMID41709239
PMCPMC13020214

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.