{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T13:57:35Z","timestamp":1776261455557,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T00:00:00Z","timestamp":1186617600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J VLSI Sign Process Syst Sign Im"],"published-print":{"date-parts":[[2007,8,31]]},"DOI":"10.1007\/s11265-007-0067-4","type":"journal-article","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T16:09:05Z","timestamp":1186589345000},"page":"271-286","source":"Crossref","is-referenced-by-count":119,"title":["Exploring New Search Algorithms and Hardware for Phylogenetics: RAxML Meets the IBM Cell"],"prefix":"10.1007","volume":"48","author":[{"given":"A.","family":"Stamatakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Blagojevic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. S.","family":"Nikolopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. D.","family":"Antonopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,8,9]]},"reference":[{"key":"67_CR1","unstructured":"IBM, \u201cCell broadband engine programming tutorial version 1.0,\u201d Available at: http:\/\/www-106.ibm.com\/developerworks\/eserver\/library\/es-archguide-v2.html ."},{"key":"67_CR2","unstructured":"D. A. Bader, B. M. E. Moret, and L. Vawter, \u201cIndustrial Applications of High-performance Computing for Phylogeny Reconstruction,\u201d in Proc. of SPIE ITCom, vol. 4528, 2001, pp. 159\u2013168."},{"key":"67_CR3","doi-asserted-by":"crossref","unstructured":"P. Bellens, J. M. Perez, R. M. Badia, and J. Labarta, \u201cCells: A Programming Model for the Cell be Architecture,\u201d in Proc. of SC2006, November 2006.","DOI":"10.1109\/SC.2006.17"},{"key":"67_CR4","doi-asserted-by":"crossref","unstructured":"C. Benthin, I. Wald, M. Scherbaum, and H. Friedrich, \u201cRay Tracing on the CELL Processor,\u201d Technical Report, inTrace Realtime Ray Tracing GmbH, No inTrace-2006-001, 2006.","DOI":"10.1109\/RT.2006.280210"},{"key":"67_CR5","doi-asserted-by":"crossref","unstructured":"F. Blagojevic, D. S. Nikolopoulos, A. Stamatakis, and C. D. Antonopoulos, \u201cDynamic Multigrain Parallelization on the Cell Broadband Engine,\u201d in Proc. of PPoPP 2007, San Jose, CA, March 2007.","DOI":"10.1145\/1229428.1229445"},{"issue":"1","key":"67_CR6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1093\/bioinformatics\/bti1027","volume":"21","author":"B. Chor","year":"2005","unstructured":"B. Chor and T. Tuller, \u201cMaximum Likelihood of Evolutionary Trees: Hardness and Approximation,\u201d Bioinformatics, vol. 21, no. 1, 2005, pp. 97\u2013106.","journal-title":"Bioinformatics"},{"issue":"4","key":"67_CR7","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.compbiolchem.2005.06.003","volume":"29","author":"Z. Du","year":"2005","unstructured":"Z. Du, F. Lin, and U. Roshan, \u201cReconstruction of Large Phylogenetic Trees: A Parallel Approach,\u201d Computational Biology and Chemistry, vol. 29, no. 4, 2005, pp. 273\u2013280.","journal-title":"Computational Biology and Chemistry"},{"key":"67_CR8","doi-asserted-by":"crossref","unstructured":"A. E. Eichenberger et al., \u201cOptimizing Compiler for a Cell processor,\u201d Parallel Architectures and Compilation Techniques, September 2005.","DOI":"10.1109\/PACT.2005.33"},{"key":"67_CR9","doi-asserted-by":"crossref","unstructured":"D. Pham et al., \u201cThe Design and Implementation of a First Generation Cell Processor,\u201d Proc. Int\u2019l Solid-State Circuits Conf. Tech. Digest, IEEE Press, 2005, pp. 184\u2013185.","DOI":"10.1109\/ISSCC.2005.1493930"},{"key":"67_CR10","doi-asserted-by":"crossref","unstructured":"K. Fatahalian et al., \u201cSequoia: Programming the Memory Hierarchy,\u201d in Proc. of SC2006, November 2006.","DOI":"10.1109\/SC.2006.55"},{"issue":"5","key":"67_CR11","doi-asserted-by":"crossref","first-page":"3685","DOI":"10.1128\/AEM.72.5.3685-3695.2006","volume":"72","author":"R. E. Ley","year":"2006","unstructured":"R. E. Ley et al., \u201cUnexpected Diversity and Complexity of the Guerrero Negro Hypersaline Microbial Mat,\u201d Appl. Environ. Microbiol., vol. 72, no. 5, 2006, pp. 3685\u20133695, May.","journal-title":"Appl. Environ. Microbiol."},{"key":"67_CR12","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/BF01734359","volume":"17","author":"J. Felsenstein","year":"1981","unstructured":"J. Felsenstein, \u201cEvolutionary Trees from DNA Sequences: A Maximum Likelihood Approach,\u201d J. Mol. Evol., vol. 17, 1981, pp. 368\u2013376.","journal-title":"J. Mol. Evol."},{"key":"67_CR13","first-page":"279","volume":"2","author":"G. W. Grimm","year":"2006","unstructured":"G. W. Grimm, S. S. Renner, A. Stamatakis, and V. Hemleben, \u201cA Nuclear Ribosomal DNA Phylogeny of Acer Inferred with Maximum Likelihood, Splits Graphs, and Motif Analyses of 606 Sequences,\u201d Evolutionary Bioinformatics Online, vol. 2, 2006, pp. 279\u2013294.","journal-title":"Evolutionary Bioinformatics Online"},{"issue":"5","key":"67_CR14","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1080\/10635150390235520","volume":"52","author":"S. Guindon","year":"2003","unstructured":"S. Guindon and O. Gascuel, \u201cA Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood,\u201d Syst. Biol., vol. 52, no. 5, 2003, pp. 696\u2013704.","journal-title":"Syst. Biol."},{"key":"67_CR15","unstructured":"N. Hjelte, Smoothed Particle Hydrodynamics on the Cell Broadband Engine. Masters Thesis, June 2006."},{"key":"67_CR16","unstructured":"W. Kahan, \u201cLecture Notes on the Status of IEEE Standard 754 for Binary Floating-point Arithmetic,\u201d in IEEE, 1997."},{"key":"67_CR17","unstructured":"D. Kunzman, G. Zheng, E. Bohm, and L. V. Kal\u00e9, \u201cCharm++, Offload API, and the Cell Processor,\u201d in Proc. of the Workshop on Programming Models for Ubiquitous Parallelism, Seattle, WA, USA, September 2006."},{"key":"67_CR18","unstructured":"Sun Microsystems, Sun UltraSPARC T1 Cool Threads Technology, December 2005. http:\/\/www.sun.com\/aboutsun\/media\/presskits\/networkcomputing05q4\/T1Infographic.pdf ."},{"issue":"19","key":"67_CR19","doi-asserted-by":"crossref","first-page":"3794","DOI":"10.1093\/bioinformatics\/bti594","volume":"21","author":"B. Q. Minh","year":"2005","unstructured":"B. Q. Minh, L. S. Vinh, A. V. Haeseler, and H. A. Schmidt, \u201cpIQPNNI: Parallel Reconstruction of Large Maximum Likelihood Phylogenies,\u201d Bioinformatics, vol. 21, no. 19, 2005, pp. 3794\u20133796.","journal-title":"Bioinformatics"},{"key":"67_CR20","unstructured":"B. Q. Minh, L. S. Vinh, H. A. Schmidt, and A. V. Haeseler, \u201cLarge Maximum Likelihood Trees,\u201d in Proc. of the NIC Symposium 2006, 2006, pp. 357\u2013365."},{"key":"67_CR21","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1016\/j.mib.2005.10.003","volume":"8","author":"C. E. Robertson","year":"2005","unstructured":"C. E. Robertson, J. K. Harris, J. R. Spear, and N. R. Pace, \u201cPhylogenetic Diversity and Ecology of Environmental Archaea,\u201d Curr. Opin. Microbiol., vol. 8, 2005, pp. 638\u2013642.","journal-title":"Curr. Opin. Microbiol."},{"issue":"12","key":"67_CR22","doi-asserted-by":"crossref","first-page":"1572","DOI":"10.1093\/bioinformatics\/btg180","volume":"19","author":"F. Ronquist","year":"2003","unstructured":"F. Ronquist and J. P. Huelsenbeck, \u201cMrBayes 3: Bayesian Phylogenetic Inference under Mixed Models,\u201d Bioinformatics, vol. 19, no. 12, 2003, pp. 1572\u20131574.","journal-title":"Bioinformatics"},{"key":"67_CR23","unstructured":"A. Stamatakis, Distributed and Parallel Algorithms and Systems for Inference of Huge Phylogenetic Trees based on the Maximum Likelihood Method, PhD thesis, Technische Universit\u00e4t M\u00fcnchen, Germany, October 2004."},{"key":"67_CR24","doi-asserted-by":"crossref","unstructured":"A. Stamatakis, \u201cPhylogenetic Models of Rate Heterogeneity: A High Performance Computing Perspective,\u201d in Proc. of IPDPS2006, HICOMB Workshop, Proceedings on CD, Rhodos, Greece, April 2006.","DOI":"10.1109\/IPDPS.2006.1639535"},{"issue":"21","key":"67_CR25","doi-asserted-by":"crossref","first-page":"2688","DOI":"10.1093\/bioinformatics\/btl446","volume":"22","author":"A. Stamatakis","year":"2006","unstructured":"A. Stamatakis, \u201cRAxML-VI-HPC: Maximum Likelihood-based Phylogenetic Analyses with Thousands of Taxa and Mixed Models,\u201d Bioinformatics, vol. 22, no. 21, 2006, pp. 2688\u20132690.","journal-title":"Bioinformatics"},{"key":"67_CR26","doi-asserted-by":"crossref","unstructured":"A. Stamatakis, T. Ludwig, and H. Meier, \u201cParallel Inference of a 10.000-taxon Phylogeny with Maximum Likelihood,\u201d in Proc. of Euro\u2013Par 2004, September 2004, pp. 997\u20131004.","DOI":"10.1007\/978-3-540-27866-5_134"},{"issue":"4","key":"67_CR27","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1093\/bioinformatics\/bti191","volume":"21","author":"A. Stamatakis","year":"2005","unstructured":"A. Stamatakis, T. Ludwig, and H. Meier, \u201cRAxML-III: A Fast Program for Maximum Likelihood-based Inference of Large Phylogenetic Trees,\u201d Bioinformatics, vol. 21, no. 4, 2005, pp. 456\u2013463.","journal-title":"Bioinformatics"},{"key":"67_CR28","doi-asserted-by":"crossref","unstructured":"A. Stamatakis, M. Ott, and T. Ludwig, \u201cRAxML-OMP: An Efficient Program for Phylogenetic Inference on SMPs,\u201d PaCT, 2005, pp. 288\u2013302.","DOI":"10.1007\/11535294_25"},{"key":"67_CR29","doi-asserted-by":"crossref","unstructured":"C. Stewart, D. Hart, D. Berry, G. Olsen, E. Wernert, and W. Fischer, \u201cParallel Implementation and Performance of FastDNAml\u2014A Program for Maximum Likelihood Phylogenetic Inference,\u201d in Proc. of SC2001, Denver, CO, November 2001.","DOI":"10.1145\/582034.582054"},{"key":"67_CR30","unstructured":"D. Wang, \u201cCell Microprocessor III,\u201d Real World Technologies, July 2005."},{"key":"67_CR31","unstructured":"D. Zwickl, Genetic Algorithm Approaches for the Phylogenetic Analysis of Large Biologiical Sequence Datasets under the Maximum Likelihood Criterion. PhD thesis, University of Texas at Austin, April 2006."}],"container-title":["The Journal of VLSI Signal Processing Systems for Signal, Image, and Video Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-007-0067-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11265-007-0067-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-007-0067-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T08:19:24Z","timestamp":1559377164000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11265-007-0067-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,9]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,8,31]]}},"alternative-id":["67"],"URL":"https:\/\/doi.org\/10.1007\/s11265-007-0067-4","relation":{},"ISSN":["0922-5773","1573-109X"],"issn-type":[{"value":"0922-5773","type":"print"},{"value":"1573-109X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8,9]]}}}