ArticleAlgorithms for molecular biology : AMB2021
The Bourque distances for mutation trees of cancers.
Article in Algorithms for molecular biology : AMB, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 7 papers.
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.
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.
Who cites it
7 citing papers in PubMed, 14 citations in OpenAlex.
- Identifying Robust Subclonal Structures through Tumor Progression Tree Alignment.bioRxiv : the preprint server for biology · 2026Article
- Bayesian inference of fitness landscapes via tree-structured branching processes.Bioinformatics (Oxford, England) · 2025Article
- New generalized metric based on branch length distance to compare B cell lineage trees.Algorithms for molecular biology : AMB · 2024Article
- Weighted centroid trees: a general approach to summarize phylogenies in single-labeled tumor mutation tree inference.Bioinformatics (Oxford, England) · 2024Article
- Oncotree2vec - a method for embedding and clustering of tumor mutation trees.Bioinformatics (Oxford, England) · 2024Article
- TheJournal of computational biology : a journal of computational molecular cell biology · 2024Article
- A weighted distance-based approach for deriving consensus tumor evolutionary trees.Bioinformatics (Oxford, England) · 2023Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors at 2 institutions in 2 countries.
Funding
No grant is acknowledged in the PubMed record.
Abstract
backgroundMutation trees are rooted trees in which nodes are of arbitrary degree and labeled with a mutation set. These trees, also referred to as clonal trees, are used in computational oncology to represent the mutational history of tumours. Classical tree metrics such as the popular Robinson-Foulds distance are of limited use for the comparison of mutation trees. One reason is that mutation trees inferred with different methods or for different patients often contain different sets of mutation labels.
resultsWe generalize the Robinson-Foulds distance into a set of distance metrics called Bourque distances for comparing mutation trees. We show the basic version of the Bourque distance for mutation trees can be computed in linear time. We also make a connection between the Robinson-Foulds distance and the nearest neighbor interchange distance.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.