{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T01:37:26Z","timestamp":1787708246484,"version":"build-2784847793"},"reference-count":27,"publisher":"Oxford University Press (OUP)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005,2,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Motivation: The computation of large phylogenetic trees with statistical models such as maximum likelihood or bayesian inference is computationally extremely intensive. It has repeatedly been demonstrated that these models are able to recover the true tree or a tree which is topologically closer to the true tree more frequently than less elaborate methods such as parsimony or neighbor joining. Due to the combinatorial and computational complexity the size of trees which can be computed on a Biologist's PC workstation within reasonable time is limited to trees containing approximately 100 taxa.<\/jats:p>\n               <jats:p>Results: In this paper we present the latest release of our program RAxML-III for rapid maximum likelihood-based inference of large evolutionary trees which allows for computation of 1.000-taxon trees in less than 24 hours on a single PC processor. We compare RAxML-III to the currently fastest implementations for maximum likelihood and bayesian inference: PHYML and MrBayes. Whereas RAxML-III performs worse than PHYML and MrBayes on synthetic data it clearly outperforms both programs on all real data alignments used in terms of speed and final likelihood values.<\/jats:p>\n               <jats:p>Availability Supplementary information: RAxML-III including all alignments and final trees mentioned in this paper is freely available as open source code at http:\/\/wwwbode.cs.tum\/~stamatak<\/jats:p>\n               <jats:p>Contact: \u00a0stamatak@cs.tum.edu<\/jats:p>","DOI":"10.1093\/bioinformatics\/bti191","type":"journal-article","created":{"date-parts":[[2004,12,18]],"date-time":"2004-12-18T01:16:41Z","timestamp":1103332601000},"page":"456-463","source":"Crossref","is-referenced-by-count":1185,"title":["RAxML-III: a fast program for maximum likelihood-based inference of large phylogenetic trees"],"prefix":"10.1093","volume":"21","author":[{"given":"A.","family":"Stamatakis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"T.","family":"Ludwig","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"H.","family":"Meier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2004,12,17]]},"reference":[{"key":"2023013107235466400_B1","unstructured":"Bininda-Emonds, O.R.P. and Sanderson, M.J. 2001An assessment of the accuracy of MRP supertree construction. Syst. Biol.50565\u2013579"},{"key":"2023013107235466400_B2","doi-asserted-by":"crossref","unstructured":"Brauer, M.J., Holder, M.T., Dries, L.A., Zwickl, D.J., Lewis, P.O., Hillis, D.M. 2002Genetic algorithms and parallel processing in maximum-likelihood phylogeny inference. Mol. Biol. Evol.191717\u20131726","DOI":"10.1093\/oxfordjournals.molbev.a003994"},{"key":"2023013107235466400_B3","unstructured":"Chase, M.W., Soltis, D.E., Olmstead, R.G., Morgan, D., Les, D.H., Mishler, B.D., Duvall, M.R., Price, R.A., Hills, H.G., Qiu, Y.L., et al. 1993Phylogenetics of seed plants: an analysis of nucleotide sequences from the plastid gene. rbcL. Ann. Missouri Bot. Garden80528\u2013580"},{"key":"2023013107235466400_B4","doi-asserted-by":"crossref","unstructured":"Felsenstein, J. 1981Evolutionary trees from DNA sequences: a maximum likelihood approach. J. Mol. Evol.17368\u2013376","DOI":"10.1007\/BF01734359"},{"key":"2023013107235466400_B5","doi-asserted-by":"crossref","unstructured":"Guindon, S. and Gascuel, O. 2003A simple, fast, and accurate algorithm to estimate large phylogenies by maximum likelihood. Syst. Biol.52696\u2013704","DOI":"10.1080\/10635150390235520"},{"key":"2023013107235466400_B6","doi-asserted-by":"crossref","unstructured":"Hasegawa, M., Kishino, H., Yano, T. 1985Dating of the human\u2013ape splitting by a molecular clock of mitochondrial DNA. J. Mol. Evol.22160\u2013174","DOI":"10.1007\/BF02101694"},{"key":"2023013107235466400_B7","unstructured":"Holder, M.T. and Lewis, P.O. 2003Phylogeny estimation: traditional and Bayesian approaches. Nat. Rev. Genet.4275\u2013284"},{"key":"2023013107235466400_B8","unstructured":"Huelsenbeck, J.P. and Ronquist, F. 2001MRBAYES: Bayesian inference of phylogenetic trees. Bioinformatics17754\u2013755"},{"key":"2023013107235466400_B9","doi-asserted-by":"crossref","unstructured":"Huelsenbeck, J.P., Ronquist, F., Nielsen, R., Bollback, J.P. 2001Bayesian inference and its impact on evolutionary biology. Science2942310\u20132314","DOI":"10.1126\/science.1065889"},{"key":"2023013107235466400_B10","doi-asserted-by":"crossref","unstructured":"Huelsenbeck, J.P., Larget, B., Miller, R.E., Ronquist, F. 2002Potential applications and pitfalls of Bayesian inference of phylogeny. Syst. Biol.51673\u2013688","DOI":"10.1080\/10635150290102366"},{"key":"2023013107235466400_B11","doi-asserted-by":"crossref","unstructured":"Lanave, C., Preparata, G., Saccone, C., Serio, G. 1984A new method for calculating evolutionary substitution rates. J. Mol. Evol.2086\u201393","DOI":"10.1007\/BF02101990"},{"key":"2023013107235466400_B12","doi-asserted-by":"crossref","unstructured":"Lemmon, A. and Milinkovitch, M. 2002The metapopulation genetic algorithm: an efficient solution for the problem of large phylogeny estimation. Proc. Natl Acad. Sci. USA9910516\u201310521","DOI":"10.1073\/pnas.162224399"},{"key":"2023013107235466400_B13","unstructured":"Lewis, P. 1998A genetic algorithm for maximum likelihood phylogeny inference using nucleotide sequence data. Mol. Biol. Evol.15277\u2013283"},{"key":"2023013107235466400_B14","unstructured":"Ludwig, W., Stunk, O., Westram, R., Richter, L., Meier, H., Yadhukumar, H., Buchner, A., Lai, T., Steppi, S., Jobb, G., et al. 2004ARB: a software environment for sequence data. Nucleic Acids Res.321363\u20131371"},{"key":"2023013107235466400_B15","doi-asserted-by":"crossref","unstructured":"Olsen, G., Matsuda, H., Hagstrom, R., Overbeek, R. 1994fastDNAmL: a tool for construction of phylogenetic trees of DNA sequences using maximum likelihood. Comput. Appl. Biosci.1041\u201348","DOI":"10.1093\/bioinformatics\/10.1.41"},{"key":"2023013107235466400_B16","doi-asserted-by":"crossref","unstructured":"Rambaut, A. and Grassly, N.C. 1997Seq-Gen: an application for the Monte Carlo simulation of DNA sequence evolution along phylogenetic trees. Comput. Appl. Biosci.13235\u2013238","DOI":"10.1093\/bioinformatics\/13.3.235"},{"key":"2023013107235466400_B17","doi-asserted-by":"crossref","unstructured":"Robinson, D. and Foulds, L. 1979Comparison of weighted labeled trees. In Horadam, A.F. and Wallis, W.D. (Eds.). Isomorphic Factorisations VI: Automorphisms, Combinatorial Mathematics VI, Lecture Notes in Mathematics , Berlin  Springer 748,  pp. 119\u2013126","DOI":"10.1007\/BFb0102691"},{"key":"2023013107235466400_B18","doi-asserted-by":"crossref","unstructured":"Sanderson, M.J. 2003r8s: inferring absolute rates of molecular evolution and divergence times in the absence of a molecular clock. Bioinformatics19301\u2013302","DOI":"10.1093\/bioinformatics\/19.2.301"},{"key":"2023013107235466400_B19","doi-asserted-by":"crossref","unstructured":"Stamatakis, A., Ludwig, T., Meier, H., Wolf, M.J. 2002Accelerating parallel maximum likelihood-based phylogenetic tree computations using subtree equality vectors. Proceedings of 15th IEEE\/ACM Supercomputing Conference (SC2002) , Baltimore, MD  November","DOI":"10.1109\/SC.2002.10016"},{"key":"2023013107235466400_B20","unstructured":"Stamatakis, A., Ludwig, T., Meier, H. 2004New fast and accurate heuristics for inference of large phylogenetic trees. Proceedings of 18th IEEE\/ACM International Parallel and Distributed Processing Symposium (IPDPS'04) , Santa Fe, NM  April 26\u201330"},{"key":"2023013107235466400_B21","doi-asserted-by":"crossref","unstructured":"Stamatakis, A., Ludwig, T., Meier, H. 2004Parallel inference of a 10.000-taxon phylogeny with maximum likelihood. Proceedings of Euro-Par 2004 , Pisa, Italy  August 31\u2013September 3, (to be published)","DOI":"10.1007\/978-3-540-27866-5_134"},{"key":"2023013107235466400_B22","doi-asserted-by":"crossref","unstructured":"Stewart, C., Hart, D., Berry, D., Olsen, G., Wernert, E., Fischer, W. 2001Parallel implementation and performance of fastDNAmL\u2014a program for maximum likelihood phylogenetic inference. Proceedings of 14th IEEE\/ACM Supercomputing Conference (SC2001) , Denver, CO  May 18","DOI":"10.1145\/582034.582054"},{"key":"2023013107235466400_B23","doi-asserted-by":"crossref","unstructured":"Strimmer, K. and Haeseler, A.V. 1996Quartet puzzling: a maximum likelihood method for reconstructing tree topologies. Mol. Biol. Evol.13,  pp. 964\u2013969","DOI":"10.1093\/oxfordjournals.molbev.a025664"},{"key":"2023013107235466400_B24","unstructured":"Swofford, D. PAUP*: Phylogenetic Analysis Using Parsimony (*and Other Methods)1999, Sunderland, MA  Sinauer Associates"},{"key":"2023013107235466400_B25","doi-asserted-by":"crossref","unstructured":"Tuffley, C. and Steel, M. 1997Links between maximum likelihood and maximum parsimony under a simple model of site substitution. Bull. Math. Biol.59,  pp. 581\u2013607","DOI":"10.1007\/BF02459467"},{"key":"2023013107235466400_B26","unstructured":"Williams, T.L. and Moret, B.M.E. 2003An investigation of phylogenetic likelihood methods. Proceedings of 3rd IEEE International Symposium on Bioinformatics and Bioengineering (BIBE'03) , Bethesda, MD  March 10\u201312"},{"key":"2023013107235466400_B27","doi-asserted-by":"crossref","unstructured":"Yang, Y. 1997PAML: a program package for phylogenetic analysis by maximum likelihood. Comput. Appl. Biosci.13,  pp. 555\u2013556","DOI":"10.1093\/bioinformatics\/13.5.555"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/21\/4\/456\/48965168\/bioinformatics_21_4_456.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/21\/4\/456\/48965168\/bioinformatics_21_4_456.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T10:14:18Z","timestamp":1675160058000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/21\/4\/456\/203612"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12,17]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,2,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/bti191","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2005,2,15]]},"published":{"date-parts":[[2004,12,17]]}}}