ArticleBMC genomics2014
Disk covering methods improve phylogenomic analyses.
Article in BMC genomics, 2014. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 12 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
12 citing papers in PubMed.
- wQFM-TREE: highly accurate and scalable quartet-based species tree inference from gene trees.Bioinformatics advances · 2025Article
- Machine learning based imputation techniques for estimating phylogenetic trees from incomplete distance matrices.BMC genomics · 2020Article
- Unblended disjoint tree merging using GTM improves species tree estimation.BMC genomics · 2020Article
- STELAR: a statistically consistent coalescent-based species tree estimation method by maximizing triplet consistency.BMC genomics · 2020Article
- Statistically consistent divide-and-conquer pipelines for phylogeny estimation using NJMerge.Algorithms for molecular biology : AMB · 2019Article
- Reconstructing evolutionary trees in parallel for massive sequences.BMC systems biology · 2017Article
- IDXL: Species Tree Inference Using Internode Distance and Excess Gene Leaf Count.Journal of molecular evolution · 2017Article
- FastRFS: fast and accurate Robinson-Foulds Supertrees using constrained exact optimization.Bioinformatics (Oxford, England) · 2017Article
- ASTRAL-II: coalescent-based species tree estimation with many hundreds of taxa and thousands of genes.Bioinformatics (Oxford, England) · 2015Article
- ASTRID: Accurate Species TRees from Internode Distances.BMC genomics · 2015Article
- A comparative study of SVDquartets and other coalescent-based species tree estimation methods.BMC genomics · 2015Article
- BBCA: Improving the scalability of *BEAST using random binning.BMC genomics · 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
motivationWith the rapid growth rate of newly sequenced genomes, species tree inference from multiple genes has become a basic bioinformatics task in comparative and evolutionary biology. However, accurate species tree estimation is difficult in the presence of gene tree discordance, which is often due to incomplete lineage sorting (ILS), modelled by the multi-species coalescent. Several highly accurate coalescent-based species tree estimation methods have been developed over the last decade, including MP-EST. However, the running time for MP-EST increases rapidly as the number of species grows.
resultsWe present divide-and-conquer techniques that improve the scalability of MP-EST so that it can run efficiently on large datasets. Surprisingly, this technique also improves the accuracy of species trees estimated by MP-EST, as our study shows on a collection of simulated and biological datasets.
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.