The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
RAxML-NG: A fast, scalable, and user-friendly tool for maximum likelihood phylogenetic inference
Open accessAbstract
Motivation: Phylogenies are important for fundamental biological research, but also have numerous applications in biotechnology, agriculture, and medicine. Finding the optimal tree under the popular maximum like-lihood (ML) criterion is known to be NP-hard. Thus, highly optimized and scalable codes are needed to analyze constantly growing empirical datasets. Results: We present RAxML-NG, a from scratch re-implementation of the established greedy tree search algorithm of RAxML/ExaML. RAxML- NG offers improved accuracy, flexibility, speed, scalability, and usability compared to RAxML/ExaML. On taxon-rich datasets, RAxML-NG typically finds higher-scoring trees than IQTree, an increasingly popular recent tool for ML-based phylogenetic inference (although IQ-Tree shows better stability). Finally, RAxML-NG introduces several new features, such as the detection of terraces in tree space and a the recently introduced transfer bootstrap support metric. Availability: The code is available under GNU GPL at https://github.com/amkozlov/raxml-ng.RAxML-NG web service (maintained by Vital- IT) is available at https://raxml-ng.vital-it.ch/ . Contact: alexey.kozlov@h-its.org
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
RAxML version 8: a tool for phylogenetic analysis and post-analysis of large phylogenies
Stamatakis, A. (2014) · Bioinformatics · doi:10.1093/bioinformatics/btu033 · Cited by 32,291
Self-citationIQ-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
Renewing Felsenstein’s phylogenetic bootstrap in the era of big data
Lemoine, F., Domelevo Entfellner, J.-B., Wilkinson, E., Correia, D., Dávila Felipe, M., De Oliveira, T., & Gascuel, O. (2018) · Nature · doi:10.1038/s41586-018-0043-0 · Cited by 700
EPA-ng: Massively Parallel Evolutionary Placement of Genetic Sequences
Barbera, P., Kozlov, A. M., Czech, L., Morel, B., Darriba, D., Flouri, T., & Stamatakis, A. (2019) · Systematic Biology · doi:10.1093/sysbio/syy054 · Cited by 687
Self-citationSlobbe, L., Doorduijn, J. K., Lugtenburg, P. J., el Barzouhi, A., Boersma, E., van Leeuwen, W. B., & Rijnders, B. J. A. (2010) · PLoS ONE · doi:10.1371/journal.pone.0010840 · Cited by 490
A space-time process model for the evolution of DNA sequences.
Yang, Z. (1995) · Genetics · doi:10.1093/genetics/139.2.993 · Cited by 428
Empirical profile mixture models for phylogenetic reconstruction
Si Quang, L., Gascuel, O., & Lartillot, N. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn445 · Cited by 358
Phylogenetic models of rate heterogeneity: a high performance computing perspective
Stamatakis, A. (2006) · Proceedings 20th IEEE International Parallel & Distributed Processing Symposium · doi:10.1109/ipdps.2006.1639535 · Cited by 284
Self-citationExaML version 3: a tool for phylogenomic analyses on supercomputers
Kozlov, A. M., Aberer, A. J., & Stamatakis, A. (2015) · Bioinformatics · doi:10.1093/bioinformatics/btv184 · Cited by 236
Self-citationModeling Protein Evolution with Several Amino Acid Replacement Matrices Depending on Site Rates
Le, S. Q., Dang, C. C., & Gascuel, O. (2012) · Molecular Biology and Evolution · doi:10.1093/molbev/mss112 · Cited by 223
Zhou, X., Shen, X.-X., Hittinger, C. T., & Rokas, A. (2018) · Molecular Biology and Evolution · doi:10.1093/molbev/msx302 · Cited by 164
Terraces in phylogenetic tree space
Sanderson, M. J., McMahon, M. M., & Steel, M. (2011) · Science · doi:10.1126/science.1206357 · Cited by 144
Baele, G., de Peer, Y. V., & Vansteelandt, S. (2010) · Journal of Molecular Evolution · doi:10.1007/s00239-010-9362-y · Cited by 25
Efficient Detection of Repeating Sites to Accelerate Phylogenetic Likelihood Calculations
Kobert, K., Stamatakis, A., & Flouri, T. (2016) · Systematic Biology · doi:10.1093/sysbio/syw075 · Cited by 21
Self-citationThe Divisible Load Balance Problem and Its Application to Phylogenetic Inference
Kobert, K., Flouri, T., Aberer, A. J., et al. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44753-6_16 · Cited by 19
Self-citationTwo C++ libraries for counting trees on a phylogenetic terrace
Biczok, R., Bozsoky, P., Eisenmann, P., Ernst, J., Ribizel, T., Scholz, F., Trefzer, A. C., Weber, F., Hamann, M., & Stamatakis, A. (2018) · Bioinformatics · doi:10.1093/bioinformatics/bty384 · Cited by 14
Self-citation
Cited by
IQ-TREE 2: New Models and Efficient Methods for Phylogenetic Inference in the Genomic Era
Minh, B. Q., Schmidt, H. A., Chernomor, O., Schrempf, D., Woodhams, M. D., von Haeseler, A., & Lanfear, R. (2020) · Molecular Biology and Evolution · doi:10.1093/molbev/msaa015 · Cited by 16,873
ModelTest-NG: A New and Scalable Tool for the Selection of DNA and Protein Evolutionary Models
Darriba, D., Posada, D., Kozlov, A. M., Stamatakis, A., Morel, B., & Flouri, T. (2020) · Molecular Biology and Evolution · doi:10.1093/molbev/msz189 · Cited by 2,105
Self-citationRecurrent emergence and transmission of a SARS-CoV-2 spike deletion H69/V70
Kemp, S. A., Meng, B., Ferriera, I. A., Datir, R., Harvey, W. T., Papa, G., Lytras, S., Collier, D. A., Mohamed, A., Gallo, G., et al. (2020) · doi:10.1101/2020.12.14.422555 · Cited by 252
Catanach, T. A., Halley, M. R., & Pirro, S. (2025) · Biological Journal of the Linnean Society · doi:10.1093/biolinnean/blae028 · Cited by 76
A single loss of photosynthesis in the diatom order Bacillariales (Bacillariophyta)
Onyshchenko, A., Ruck, E. C., Nakov, T., & Alverson, A. J. (2019) · American Journal of Botany · doi:10.1002/ajb2.1267 · Cited by 18
Metadata
- Authors
- Kozlov, A. M., Darriba, D., Flouri, T., Morel, B., & Stamatakis, A.
- Venue
- bioRxiv (Cold Spring Harbor Laboratory)
- Publisher
- openRxiv
- Published
- 2018-10-18
- OpenAlex
- W2897782355
- Cited by
- 256
- References
- 17
- Type
- posted content
- Language
- en
- Open access
- green
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.