Harnessing machine learning to guide phylogenetic-tree search algorithms
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Inferring a phylogenetic tree is a fundamental challenge in evolutionary studies. Current paradigms for phylogenetic tree reconstruction rely on performing costly likelihood optimizations. With the aim of making tree inference feasible for problems involving more than a handful of sequences, inference under the maximum-likelihood paradigm integrates heuristic approaches to evaluate only a subset of all potential trees. Consequently, existing methods suffer from the known tradeoff between accuracy and running time. In this proof-of-concept study, we train a machine-learning algorithm over an extensive cohort of empirical data to predict the neighboring trees that increase the likelihood, without actually computing their likelihood. This provides means to safely discard a large set of the search space, thus potentially accelerating heuristic tree searches without losing accuracy. Our analyses suggest that machine learning can guide tree-search methodologies towards the most promising candidate trees.
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
Scikit-learn: Machine Learning in Python
(2011) · Journal of Machine Learning Research · doi:10.5555/1953048.2078195 · Cited by 8,539
Codon-substitution models for heterogeneous selection pressure at amino acid sites
Yang, Z., Nielsen, R., Goldman, N., & Pedersen, A.-M. K. (2000) · Genetics · doi:10.1093/genetics/155.1.431 · Cited by 2,286
Nielsen, R., & Yang, Z. (1998) · Genetics · doi:10.1093/genetics/148.3.929 · Cited by 1,622
PhyloBayes 3: a Bayesian software package for phylogenetic reconstruction and molecular dating
Lartillot, N., Lepage, T., & Blanquart, S. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp368 · Cited by 1,297 · cited 2×
“The output of this learner, trained on a succinct collection of 19 features, is a numerical value for each possible SPR move that represents its propensity to be the highest-scoring neighbor.”
BackgroundMethodDuchêne, D. A., Tong, K. J., Foster, C. S. P., Duchêne, S., Lanfear, R., & Ho, S. Y. W. (2020) · Molecular Biology and Evolution · doi:10.1093/molbev/msz291 · Cited by 53
Cited by
Incongruence in the phylogenomics era
Steenwyk, J. L., Li, Y., Zhou, X., Shen, X.-X., & Rokas, A. (2023) · Nature Reviews Genetics · doi:10.1038/s41576-023-00620-x · Cited by 259
Biology and medicine in the landscape of quantum advantages
Cordier, B. A., Sawaya, N. P. D., Guerreschi, G. G., & McWeeney, S. K. (2022) · Journal of The Royal Society Interface · doi:10.1098/rsif.2022.0541 · Cited by 87
“The topology of a phylogenetic tree may be initialized randomly from the MSA and is often inferred by hierarchical clustering with a maximumlikelihood estimator (MLE) [375].”
BackgroundEvolutionary sparse learning for phylogenomics
Kumar, S., & Sharma, S. (2021) · Molecular Biology and Evolution · doi:10.1093/molbev/msab227 · Cited by 22
Accurate and Efficient Phylogenetic Inference through End-To-End Deep Learning
Zhang, X., Ding, S., Yu, C., Zhao, J., & Bu, D. (2025) · Molecular Biology and Evolution · doi:10.1093/molbev/msaf260 · Cited by 2
Metadata
- Authors
- Azouri, D., Abadi, S., Mansour, Y., Mayrose, I., & Pupko, T.
- Venue
- Nature Communications
- Published
- 2021-03-31
- Volume
- 12
- Issue
- 1
- Pages
- 1983-1983
- ISSN
- 2041-1723 (ISSN-L)
- OpenAlex
- W3148521828
- Cited by
- 66
- References
- 5
- FWCI
- 2.82
- Type
- journal article
- Language
- en
- Open access
- gold
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: Harnessing machine learning to guide phylogenetic-tree search algorithms. https://app.cochat.ai/papers/10.1038/s41467-021-22073-8
- The paper
- Azouri, D., Abadi, S., Mansour, Y., Mayrose, I., & Pupko, T. (2021). Harnessing machine learning to guide phylogenetic-tree search algorithms. Nature Communications. https://doi.org/10.1038/s41467-021-22073-8
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.