The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Improving the efficiency of SPR moves in phylogenetic tree search methods based on maximum likelihood
Abstract
Motivation: Maximum likelihood (ML) methods have become very popular for constructing phylogenetic trees from sequence data. However, despite noticeable recent progress, with large and difficult datasets (e.g. multiple genes with conflicting signals) current ML programs still require huge computing time and can become trapped in bad local optima of the likelihood function. When this occurs, the resulting trees may still show some of the defects (e.g. long branch attraction) of starting trees obtained using fast distance or parsimony programs. Methods: Subtree pruning and regrafting (SPR) topological rearrangements are usually sufficient to intensively search the tree space. Here, we propose two new methods to make SPR moves more efficient. The first method uses a fast distance-based approach to detect the least promising candidate SPR moves, which are then simply discarded. The second method locally estimates the change in likelihood for any remaining potential SPRs, as opposed to globally evaluating the entire tree for each possible move. These two methods are implemented in a new algorithm with a sophisticated filtering strategy, which efficiently selects potential SPRs and concentrates most of the likelihood computation on the promising moves. Results: Experiments with real datasets comprising 35–250 taxa show that, while indeed greatly reducing the amount of computation, our approach provides likelihood values at least as good as those of the best-known ML methods so far and is very robust to poor starting trees. Furthermore, combining our new SPR algorithm with local moves such as PHYML's nearest neighbor interchanges, the time needed to find good solutions can sometimes be reduced even more. Availability: Executables of our SPR program and the used datasets are available for download at Contact: gascuel@lirmm.fr; wim@santafe.edu
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
MRBAYES: Bayesian inference of phylogenetic trees.
Huelsenbeck, J. P., & Ronquist, F. (2001) · Bioinformatics · doi:10.1093/bioinformatics/17.8.754 · Cited by 21,937
Evolutionary trees from DNA sequences: A maximum likelihood approach.
Felsenstein, J. (1981) · Journal of Molecular Evolution · doi:10.1007/bf01734359 · Cited by 14,571 · cited 7×
“Felsenstein brought this framework to nucleotide-based phylogenetic inference (Felsenstein, 1981), and it was later also applied to amino acid sequences (Kishino et al., 1990).”
BackgroundMethodInfluentialYang, Z. (1994) · Journal of Molecular Evolution · doi:10.1007/bf00160154 · Cited by 2,960
Likelihood Calculation in Molecular Phylogenetics
Bryant, D., Galtier, N., & Poursat, M.-A. (2005) · Mathematics of Evolution and Phylogeny · doi:10.1093/oso/9780198566106.003.0002 · Cited by 57
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
Guindon, S., Dufayard, J.-F., Lefort, V., Anisimova, M., Hordijk, W., & Gascuel, O. (2010) · Systematic Biology · doi:10.1093/sysbio/syq010 · Cited by 18,376
Self-citationRAxML-VI-HPC: maximum likelihood-based phylogenetic analyses with thousands of taxa and mixed models
Stamatakis, A. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl446 · Cited by 15,582
FastTree 2 – Approximately Maximum-Likelihood Trees for Large Alignments
Price, M. N., Dehal, P. S., & Arkin, A. P. (2010) · PLoS ONE · doi:10.1371/journal.pone.0009490 · Cited by 14,894
A Rapid Bootstrap Algorithm for the RAxML Web Servers
Stamatakis, A., Hoover, P., & Rougemont, J. (2008) · Systematic Biology · doi:10.1080/10635150802429642 · Cited by 7,028
Metadata
- Authors
- Hordijk, W., & Gascuel, O.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2005-10-18
- Volume
- 21
- Issue
- 24
- Pages
- 4338-4347
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2103513093
- Cited by
- 212
- References
- 4
- FWCI
- 2.65
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Improving the efficiency of SPR moves in phylogenetic tree search methods based on maximum likelihood. https://app.cochat.ai/papers/10.1093/bioinformatics/bti713
- The paper
- Hordijk, W., & Gascuel, O. (2005). Improving the efficiency of SPR moves in phylogenetic tree search methods based on maximum likelihood. Bioinformatics. https://doi.org/10.1093/bioinformatics/bti713
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.