ArticleAlgorithms for molecular biology : AMB2013
Inferring species trees from incongruent multi-copy gene trees using the Robinson-Foulds distance.
Article in Algorithms for molecular biology : AMB, 2013. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 17 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
17 citing papers in PubMed.
- Species Tree Branch Length Estimation despite Incomplete Lineage Sorting, Duplication, and Loss.Genome biology and evolution · 2025Article
- wQFM-DISCO: DISCO-enabled wQFM improves phylogenomic analyses despite the presence of paralogs.Bioinformatics advances · 2024Article
- Phylogenetic reconciliation.PLoS computational biology · 2022Article
- ASTRAL-Pro: Quartet-Based Species-Tree Inference despite Paralogy.Molecular biology and evolution · 2020Article
- FastMulRFS: fast and accurate species tree estimation under generic gene duplication and loss models.Bioinformatics (Oxford, England) · 2020Article
- Phylogenetic tree building in the genomic age.Nature reviews. Genetics · 2020Review
- Non-parametric correction of estimated gene trees using TRACTION.Algorithms for molecular biology : AMB · 2020Article
- Evolution through segmental duplications and losses: a Super-Reconciliation approach.Algorithms for molecular biology : AMB · 2020Article
- A transcriptome-based resolution for a key taxonomic controversy in Cupressaceae.Annals of botany · 2019Article
- IDXL: Species Tree Inference Using Internode Distance and Excess Gene Leaf Count.Journal of molecular evolution · 2017Article
- Comparing Phylogenetic Trees by Matching Nodes Using the Transfer Distance Between Partitions.Journal of computational biology : a journal of computational molecular cell biology · 2017Article
- Multilocus inference of species trees and DNA barcoding.Philosophical transactions of the Royal Society of London. Series B, Biological sciences · 2016Review
- A Bayesian Supertree Model for Genome-Wide Species Tree Reconstruction.Systematic biology · 2016Article
- Analysis of phylogenomic datasets reveals conflict, concordance, and gene duplications with examples from animals and plants.BMC evolutionary biology · 2015Article
- Adapting simultaneous analysis phylogenomic techniques to study complex disease gene relationships.Journal of biomedical informatics · 2015Article
- Are the duplication cost and Robinson-Foulds distance equivalent?Journal of computational biology : a journal of computational molecular cell biology · 2014Article
- Supertrees Based on the Subtree Prune-and-Regraft Distance.Systematic biology · 2014Article
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.
Funding
No grant is acknowledged in the PubMed record.
Abstract
backgroundConstructing species trees from multi-copy gene trees remains a challenging problem in phylogenetics. One difficulty is that the underlying genes can be incongruent due to evolutionary processes such as gene duplication and loss, deep coalescence, or lateral gene transfer. Gene tree estimation errors may further exacerbate the difficulties of species tree estimation.
resultsWe present a new approach for inferring species trees from incongruent multi-copy gene trees that is based on a generalization of the Robinson-Foulds (RF) distance measure to multi-labeled trees (mul-trees). We prove that it is NP-hard to compute the RF distance between two mul-trees; however, it is easy to calculate this distance between a mul-tree and a singly-labeled species tree. Motivated by this, we formulate the RF problem for mul-trees (MulRF) as follows: Given a collection of multi-copy gene trees, find a singly-labeled species tree that minimizes the total RF distance from the input mul-trees. We develop and implement a fast SPR-based heuristic algorithm for the NP-hard MulRF problem.We compare the performance of the MulRF method (available at http://genome.cs.iastate.edu/CBL/MulRF/) with several gene tree parsimony approaches using gene tree simulations that incorporate gene tree error, gene duplications and losses, and/or lateral transfer. The MulRF method produces more accurate species trees than gene tree parsimony approaches. We also demonstrate that the MulRF method infers in minutes a credible plant species tree from a collection of nearly 2,000 gene trees.
conclusionsOur new phylogenetic inference method, based on a generalized RF distance, makes it possible to quickly estimate species trees from large genomic data sets. Since the MulRF method, unlike gene tree parsimony, is based on a generic tree distance measure, it is appealing for analyses of genomic data sets, in which many processes such as deep coalescence, recombination, gene duplication and losses as well as phylogenetic error may contribute to gene tree discord. In experiments, the MulRF method estimated species trees accurately and quickly, demonstrating MulRF as an efficient alternative approach for phylogenetic inference from large-scale genomic data sets.
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.