RAxML-NG A fast, scalable, and user-friendly tool for maximum likelihood phylogenetic inference, bioRxiv, 2018-10-19

AbstractMotivationPhylogenies 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.ResultsWe present RAxML-NG, a from scratch re-implementation of the established greedy tree search algorithm of RAxMLExaML. RAxML- NG offers improved accuracy, flexibility, speed, scalability, and usability compared to RAxMLExaML. 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.AvailabilityThe code is available under GNU GPL at <jatsext-link xmlnsxlink=httpwww.w3.org1999xlink ext-link-type=uri xlinkhref=httpsgithub.comamkozlovraxml-ng.RAxML-NG>httpsgithub.comamkozlovraxml-ng.RAxML-NG<jatsext-link> web service (maintained by Vital- IT) is available at <jatsext-link xmlnsxlink=httpwww.w3.org1999xlink ext-link-type=uri xlinkhref=httpsraxml-ng.vital-it.ch>httpsraxml-ng.vital-it.ch<jatsext-link>.Contactalexey.kozlov@h-its.org

biorxiv bioinformatics 200-500-users 2018

 

Created with the audiences framework by Jedidiah Carlson

Powered by Hugo