Theoretical Computer Science
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
An Investigation of Phylogenetic Likelihood Methods
BIBE '03 Proceedings of the 3rd IEEE Symposium on BioInformatics and BioEngineering
Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Phylogenetic Reconstruction from Arbitrary Gene-Order Data
BIBE '04 Proceedings of the 4th IEEE Symposium on Bioinformatics and Bioengineering
An Efficient Program for Phylogenetic Inference Using Simulated Annealing
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 7 - Volume 08
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
PRIB '08 Proceedings of the Third IAPR International Conference on Pattern Recognition in Bioinformatics
Scientific workflow design with data assembly lines
Proceedings of the 4th Workshop on Workflows in Support of Large-Scale Science
Initial experiences porting a bioinformatics application to a graphics processor
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Using treemaps to visualize phylogenetic trees
ISBMDA'05 Proceedings of the 6th International conference on Biological and Medical Data Analysis
Hi-index | 0.00 |
Inference of phylogenetic trees comprising hundreds or even thousands of organisms based on the Maximum Likelihood (ML) method is computationally extremely intensive. In order to accelerate computations we implemented RAxML-OMP, an efficient OpenMP-parallelization for Symmetric Multi-Processing machines (SMPs) based on the sequential program RAxML-V (Randomized Axelerated Maximum Likelihood). RAxML-V is a program for inference of evolutionary trees based upon the ML method and incorporates several advanced search algorithms like fast hill-climbing and simulated annealing. We assess performance of RAxML-OMP on the widely used Intel Xeon, Intel Itanium, and AMD Opteron architectures. RAxML-OMP scales particularly well on the AMD Opteron architecture and achieves even super-linear speedups for large datasets (with a length ≥ 5.000 base pairs) due to improved cache-efficiency and data locality. RAxML-OMP is freely available as open source code.