TY - JOUR T1 - RAxML-NG: A fast, scalable, and user-friendly tool for maximum likelihood phylogenetic inference JF - bioRxiv DO - 10.1101/447110 SP - 447110 AU - Alexey M. Kozlov AU - Diego Darriba AU - Tomás Flouri AU - Benoit Morel AU - Alexandros Stamatakis Y1 - 2018/01/01 UR - http://biorxiv.org/content/early/2018/10/18/447110.abstract N2 - 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{at}h-its.org ER -