PBPI: a high performance implementation of Bayesian phylogenetic inference
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Dynamic multigrain parallelization on the cell broadband engine
Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming
Exploring New Search Algorithms and Hardware for Phylogenetics: RAxML Meets the IBM Cell
Journal of VLSI Signal Processing Systems
Large-scale maximum likelihood-based phylogenetic analysis on the IBM BlueGene/L
Proceedings of the 2007 ACM/IEEE conference on Supercomputing
Large-scale phylogenetic analysis on current HPC architectures
Scientific Programming - Large-Scale Programming Tools and Environments
Applying the Stream-Based Computing Model to Design Hardware Accelerators: A Case Study
SAMOS '09 Proceedings of the 9th International Workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation
Ensemble dispatching on an IBM Blue Gene/L for a bioinformatics knowledge environment
Proceedings of the 2nd Workshop on Many-Task Computing on Grids and Supercomputers
A new algorithm for reconstruction of phylogenetic tree
AIRS'08 Proceedings of the 4th Asia information retrieval conference on Information retrieval technology
Phylogenetic models of rate heterogeneity: a high performance computing perspective
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Initial experiences porting a bioinformatics application to a graphics processor
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Parallel divide-and-conquer phylogeny reconstruction by maximum likelihood
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Using treemaps to visualize phylogenetic trees
ISBMDA'05 Proceedings of the 6th International conference on Biological and Medical Data Analysis
RAxML-OMP: an efficient program for phylogenetic inference on SMPs
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Fine-grain parallelism using multi-core, Cell/BE, and GPU Systems
Parallel Computing
High-performance computing and the cloud: a match made in heaven or hell?
XRDS: Crossroads, The ACM Magazine for Students - Scientific Computing
Hi-index | 3.84 |
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. 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. 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 Contact: stamatak@cs.tum.edu