The Prevalence of Multifurcations in Tree-space and Their Implications for Tree-search
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Phylogenetic tree-search is a major aspect of many evolutionary studies. Several tree rearrangement algorithms are available for tree-search, but it is hard to draw general conclusions about their relative performance because many effects are data set specific and can be highly dependent on individual implementations (e.g., RAxML or phyml). Using only the structure of the rearrangements proposed by the Nearest Neighbor Interchange (NNI) algorithm, we show tree-search can prematurely terminate if it encounters multifurcating trees. We validate the relevance of this result by demonstrating that in real data the majority of possible bifurcating trees potentially encountered during tree-search are actually multifurcations, which suggests NNI would be expected to perform poorly. We also show that the star-decomposition algorithm is a special case of two other popular tree-search algorithms, subtree pruning and regrafting (SPR) and tree bisection and reconnection (TBR), which means that these two algorithms can efficiently escape when they encounter multifurcations. We caution against the use of the NNI algorithm and for most applications we recommend the use of more robust tree-search algorithms, such as SPR and TBR.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Genome-scale approaches to resolving incongruence in molecular phylogenies.
Rokas, A., Williams, B. L., King, N., & Carroll, S. B. (2003) · Nature · doi:10.1038/nature02053 · Cited by 1,512 · cited 1×
“First, we take the 106 genes from eight yeast species from Rokas et al (2003), which have sufficiently few taxa to examine tree space exhaustively.”
MethodLartillot, N., Brinkmann, H., & Philippe, H. (2007) · BMC Evolutionary Biology · doi:10.1186/1471-2148-7-s1-s4 · Cited by 705
(1990) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040628 · Cited by 198
Cited by
IQ-TREE: A Fast and Effective Stochastic Algorithm for Estimating Maximum-Likelihood Phylogenies
Nguyen, L.-T., Schmidt, H. A., von Haeseler, A., & Minh, B. Q. (2015) · Molecular Biology and Evolution · doi:10.1093/molbev/msu300 · Cited by 26,046
UFBoot2: Improving the Ultrafast Bootstrap Approximation
Hoang, D. T., Chernomor, O., von Haeseler, A., Minh, B. Q., & Vinh, L. S. (2018) · Molecular Biology and Evolution · doi:10.1093/molbev/msx281 · Cited by 10,881
“When resolving polytomies, there might be multiple equivalently optimal bifurcating trees (Whelan and Money 2010).”
BackgroundUltrafast Approximation for Phylogenetic Bootstrap
Minh, B. Q., Nguyen, M. A. T., & von Haeseler, A. (2013) · Molecular Biology and Evolution · doi:10.1093/molbev/mst024 · Cited by 4,844
Terraces in phylogenetic tree space
Sanderson, M. J., McMahon, M. M., & Steel, M. (2011) · Science · doi:10.1126/science.1206357 · Cited by 144
Metadata
- Authors
- Whelan, S., & Money, D.
- Venue
- Molecular Biology and Evolution
- Publisher
- Oxford University Press (OUP)
- Published
- 2010-06-28
- Volume
- 27
- Issue
- 12
- Pages
- 2674-2677
- ISSN
- 0737-4038 (ISSN-L)
- 1537-1719
- OpenAlex
- W2159593893
- Cited by
- 16
- References
- 3
- FWCI
- 0.59
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.