RAxML-NG: a fast, scalable and user-friendly tool for maximum likelihood phylogenetic inference
Heidelberg Institute for Theoretical Studies · Karlsruhe Institute of Technology
Abstract
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 likelihood (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 with RAxML/ExaML. On taxon-rich datasets, RAxML-NG typically finds higher-scoring trees than IQTree, an increasingly popular recent tool for…
Citation impact
- FWCI
- 142.69
- Percentile
- 100%
- References
- 20
Authors
5- AMAlexey M. KozlovCorresponding
Heidelberg Institute for Theoretical Studies
- DDDiego Darriba
Heidelberg Institute for Theoretical Studies
- TFTomáš Flouri
Heidelberg Institute for Theoretical Studies
- BMBenoît Morel
Heidelberg Institute for Theoretical Studies
- ASAlexandros Stamatakis
Karlsruhe Institute of Technology, Heidelberg Institute for Theoretical Studies
Topics & keywords
- Computer science
- Scalability
- Usability
- Inference
- Tree (set theory)
- Metric (unit)
- Tree traversal
- Code (set theory)
- Zero hunger