RAxML-NG: a fast, scalable and user-friendly tool for maximum likelihood phylogenetic inference

By Alexey M. Kozlov, Diego Darriba, Tomás Flouri, Benoit Morel, Alexandros Stamatakis. bioRxiv, 2018

3,694 citations recorded by the source corpus.

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. It compares favorably to IQ-Tree, an increasingly popular recent tool for ML-based phylogenetic inference. 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

View Paper: https://www.semanticscholar.org/paper/26640f9d57cf1e757ae27d093d6b087a7d838f07

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

  1. Bui Quang Minh
  2. Robert C. Edgar
  3. A. von Haeseler
  4. Olga Chernomor
  5. Heiko A. Schmidt
  6. Fangluan Gao
  7. Chuan-Yu Xiang
  8. Dmitry Meleshko

Citations in the corpus