{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T19:02:15Z","timestamp":1778871735539,"version":"3.51.4"},"reference-count":30,"publisher":"Oxford University Press (OUP)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005,4,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Motivation: In recent years there has been increased interest in producing large and accurate phylogenetic trees using statistical approaches. However for a large number of taxa, it is not feasible to construct large and accurate trees using only a single processor. A number of specialized parallel programs have been produced in an attempt to address the huge computational requirements of maximum likelihood. We express a number of concerns about the current set of parallel phylogenetic programs which are currently severely limiting the widespread availability and use of parallel computing in maximum likelihood-based phylogenetic analysis.<\/jats:p><jats:p>Results: We have identified the suitability of phylogenetic analysis to large-scale heterogeneous distributed computing. We have completed a distributed and fully cross-platform phylogenetic tree building program called distributed phylogeny reconstruction by maximum likelihood. It uses an already proven maximum likelihood-based tree building algorithm and a popular phylogenetic analysis library for all its likelihood calculations. It offers one of the most extensive sets of DNA substitution models currently available. We are the first, to our knowledge, to report the completion of a distributed phylogenetic tree building program that can achieve near-linear speedup while only using the idle clock cycles of machines. For those in an academic or corporate environment with hundreds of idle desktop machines, we have shown how distributed computing can deliver a \u2018free\u2019 ML supercomputer.<\/jats:p><jats:p>Availability: The software (and user manual) is publicly available under the terms of the GNU general public licence from the system webpage at http:\/\/www.cs.may.ie\/distributed<\/jats:p><jats:p>Contact: \u00a0tom.naughton@may.ie<\/jats:p>","DOI":"10.1093\/bioinformatics\/bti100","type":"journal-article","created":{"date-parts":[[2004,10,29]],"date-time":"2004-10-29T00:51:45Z","timestamp":1099011105000},"page":"969-974","source":"Crossref","is-referenced-by-count":37,"title":["DPRml: distributed phylogeny reconstruction by maximum likelihood"],"prefix":"10.1093","volume":"21","author":[{"given":"T. M.","family":"Keane","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. J.","family":"Naughton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. A. A.","family":"Travers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. O.","family":"McInerney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. P.","family":"McCormack","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2004,10,28]]},"reference":[{"key":"2023013107271557700_B1","unstructured":"Amdahl, G.M. 1967Validity of the single processor approach to achieving large-scale computing capabilities. AFIPS Conference Proceedings , Reston, VA AFIPS Press Vol. 30, pp. 483\u2013485"},{"key":"2023013107271557700_B2","doi-asserted-by":"crossref","unstructured":"Bodlaender, H., Fellows, M., Warnow, T. 1992Two strikes against perfect phylogeny. Proceedings of the 19th International Colloquium on Automata, Languages, and Programming , NY Lecture Notes in Computer Science Springer-Verlag Vol. 623, pp. 273\u2013283","DOI":"10.1007\/3-540-55719-9_80"},{"key":"2023013107271557700_B3","unstructured":"(Ed.). High Performance Cluster Computing: Architectures and Systems1999, NJ ISBN-0130-1378-47 Prentice Hall Inc"},{"key":"2023013107271557700_B4","doi-asserted-by":"crossref","unstructured":"Crandall, K.A. and Buhay, J.E. 2004Genomic databases and the tree of life. Science306, pp. 1144\u20131145","DOI":"10.1126\/science.1106198"},{"key":"2023013107271557700_B5","doi-asserted-by":"crossref","unstructured":"Drummond, A. and Strimmer, K. 2001PAL: an object-oriented programming library for molecular evolution and phylogenetics. Bioinformatics17662\u2013663","DOI":"10.1093\/bioinformatics\/17.7.662"},{"key":"2023013107271557700_B6","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":"2023013107271557700_B7","unstructured":"Felsenstein, J. 1989PHYLIP\u2014Phylogeny Inference Package (Version 3.2). Cladistics5164\u2013166"},{"key":"2023013107271557700_B8","unstructured":"Fritsche, K., Power, J., Waldron, J. 2001A Java distributed computation library. Proceedings of the 2nd International Conference on Parallel and Distributed Computing, Applications and Technologies PDCA 2001 , Taipei, Taiwan , pp. 236\u2013243"},{"key":"2023013107271557700_B9","unstructured":"Goode, M., Strimmer, K., Drummond, A., Buckler, E., Rodrigo, A. 2004A brief introduction to the phylogenetic analysis library, version 1.5. Proceedings of the Second Asia-Pacific Bioinformatics Conference APBC 2004 , NZ Dunedin, pp. 175\u2013179"},{"key":"2023013107271557700_B10","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":"2023013107271557700_B11","doi-asserted-by":"crossref","unstructured":"Hasegawa, M., Kishino, H., Yano, T. 1985Dating the human-age splitting by a molecular clock of mitochondrial DNA. J. Mol. Evol.22160\u2013174","DOI":"10.1007\/BF02101694"},{"key":"2023013107271557700_B12","doi-asserted-by":"crossref","unstructured":"Hershkovitz, M.A. and Leipe, D.D. 1998Phylogenetic analysis. In Baxevanis, A.D. and Ouelette, B.F.F. (Eds.). Bioinformatics: a Practical Guide to the Analysis of Genes and Proteins , New York Wiley-Liss, pp. 189\u2013230","DOI":"10.1002\/9780470110607.ch9"},{"key":"2023013107271557700_B13","unstructured":"Huelsenbeck, J.P. 1995Performance of phylogenetic methods in simulation. Syst. Biol.4417\u201348"},{"key":"2023013107271557700_B14","doi-asserted-by":"crossref","unstructured":"Huelsenbeck, J.P. and Hillis, D.M. 1993Success of phylogenetic methods in the four-taxon case. Syst. Biol.42247\u2013264","DOI":"10.2307\/2992463"},{"key":"2023013107271557700_B15","unstructured":"Jermiin, L.S., Olsen, G.J., Easteal, S. 1997Majority rule consensus of maximum likelihood trees. Mol. Biol. Evol.141296\u20131302"},{"key":"2023013107271557700_B16","doi-asserted-by":"crossref","unstructured":"Keane, T., Allen, R., Naughton, T., McInerney, J., Waldron, J. 2003Distributed Java platform with programmable MIMD capabilities. In Guelfi, N., Astesiano, E., Reggio, G. (Eds.). Scientific Engineering for Distributed Java Applications , Berlin Lecture Notes in Computer Science Springer Vol. 2604, pp. 122\u2013132","DOI":"10.1007\/3-540-36520-6_11"},{"key":"2023013107271557700_B17","doi-asserted-by":"crossref","unstructured":"Korber, B., Muldoon, M., Theiler, J., Gao, F., Gupta, R., Lapedes, A., Hahn, B.H., Wolinsky, S., Bhattacharya, T. 2000Timing the ancestor of the HIV-1 pandemic strains. Science2881789\u20131796","DOI":"10.1126\/science.288.5472.1789"},{"key":"2023013107271557700_B18","doi-asserted-by":"crossref","unstructured":"Korpela, E., Werthimer, D., Anderson, D., Cobb, J., Lebofsky, M. 2001SETI@home\u2014massively distributed computing for SETI. IEEE: Comput. Sci. Eng.377\u201383","DOI":"10.1109\/5992.895191"},{"key":"2023013107271557700_B19","doi-asserted-by":"crossref","unstructured":"Krieger, E. and Vriend, G. 2002Models@Home: distributed computing in bioinformatics using a screensaver based approach. Bioinformatics18315\u2013318","DOI":"10.1093\/bioinformatics\/18.2.315"},{"key":"2023013107271557700_B20","unstructured":"Kuhner, M.K. and Felsenstein, J. 1994A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates. Mol. Biol. Evol.11459\u2013468"},{"key":"2023013107271557700_B21","unstructured":"Larson, S.M., Snow, C.D., Shirts, M.R., Pande, V.S. 2004Folding@Home and Genome@Home: using distributed computing to tackle previously intractable problems in computational biology. In Grant, R. (Ed.). Computational Genomics: Theory and Application , Norwich, UK ISBN-1904-9330-17 Horizon Press"},{"key":"2023013107271557700_B22","doi-asserted-by":"crossref","unstructured":"Olsen, G.J., Matsuda, H., Hagstrom, R., Overbeek, R. 1994FastDNAmls: a tool for construction of phylogenetic trees of DNA sequences using maximum likelihood. Comput. Appl. Biosci.10, pp. 41\u201348","DOI":"10.1093\/bioinformatics\/10.1.41"},{"key":"2023013107271557700_B23","unstructured":"Posada, D. and Crandall, K.A. 1998MODELTEST: testing the model of DNA substitution. Bioinformatics14817\u2013818"},{"key":"2023013107271557700_B24","doi-asserted-by":"crossref","unstructured":"Ranwez, V. and Gascuel, O. 2002Improvement of distance-based phylogenetic methods by a local maximum likelihood approach using triplets. Mol. Biol. Evol.191952\u20131963","DOI":"10.1093\/oxfordjournals.molbev.a004019"},{"key":"2023013107271557700_B25","doi-asserted-by":"crossref","unstructured":"Rogers, J.S. and Swofford, D.L. 1998A fast method for approximating maximum likelihoods of phylogenetic trees from nucleotide sequences. Syst. Biol.4777\u201389","DOI":"10.1080\/106351598261049"},{"key":"2023013107271557700_B26","doi-asserted-by":"crossref","unstructured":"Rosenberg, M. and Kumar, S. 2001Traditional phylogenetic reconstruction methods reconstruct shallow and deep evolutionary relationship equally well. Mol. Biol. Evol.191823\u20131827","DOI":"10.1093\/oxfordjournals.molbev.a003969"},{"key":"2023013107271557700_B27","doi-asserted-by":"crossref","unstructured":"Schmidt, H.A., Strimmer, K., Vingron, M., von Haeseler, A. 2002TREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing. Bioinformatics18502\u2013504","DOI":"10.1093\/bioinformatics\/18.3.502"},{"key":"2023013107271557700_B28","unstructured":"Stamatakis, A.P. and Ludwig, T. 2003Phylogenetic tree inference on PC architectures with AxML\/PaxML. Proceedings of IPDPS2003 (High Performance Computational Biology Workshop) , France Nice, pp. 157\u2013160"},{"key":"2023013107271557700_B29","doi-asserted-by":"crossref","unstructured":"Stewart, C.A., Hart, D., Berry, D.K., Olsen, G.J., Wernert, E.A., Fischer, W. 2001Parallel implementation and performance of fastDNAml\u2014a program for maximum likelihood phylogenetic inference. Proceedings of SC2001 , CO, USA Denver, pp. 20\u201331","DOI":"10.1145\/582034.582054"},{"key":"2023013107271557700_B30","doi-asserted-by":"crossref","unstructured":"Thain, D., Tannenbaum, T., Livny, M. 2003Condor and the grid. In Berman, F., Hey, A., Fox, G. (Eds.). Grid Computing: Making the Global Infrastructure a Reality , NJ John Wiley, pp. 299\u2013335","DOI":"10.1002\/0470867167.ch11"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/21\/7\/969\/48967086\/bioinformatics_21_7_969.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/21\/7\/969\/48967086\/bioinformatics_21_7_969.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,19]],"date-time":"2024-12-19T06:06:57Z","timestamp":1734588417000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/21\/7\/969\/268890"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10,28]]},"references-count":30,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2005,4,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/bti100","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2005,4,1]]},"published":{"date-parts":[[2004,10,28]]}}}