From HP-SEE Wiki
- Web site: http://wwwkramer.in.tum.de/exelixis/software.html
- Described version: 7.2.8
- Licensing: GNU General Public License v3
- User documentation: http://wwwkramer.in.tum.de/exelixis/countManual7.0.4.php (manual), http://wwwkramer.in.tum.de/exelixis/hands-On.html (step by step tutorial for compiling and usage of RAXML)
- Download: http://wwwkramer.in.tum.de/exelixis/countSource728.php
- Source code: http://wwwkramer.in.tum.de/exelixis/countSource728.php
The Exelixis Lab - http://wwwkramer.in.tum.de/exelixis/software.html
RAxML (Randomized Axelerated Maximum Likelihood) is a program for sequential and parallel Maximum Likelihood based inference of large phylogenetic trees. It has originally been derived from fastDNAml which in turn was derived from Joe Felsentein’s dnaml which is part of the PHYLIP package. In addition to the sequential version, RAxML offers two ways to exploit parallelism: fine-grained parallelism that can be exploited on shared memory machines or multi-core architectures and coarse-grained parallelism that can be exploited on Linux clusters. The current version of RAxML is a highly optimized program, which handles DNA and AA (amino acids) alignments under various models of substitution and several distinct methods of rate heterogeneity. In addition, it implements a significantly improved version of the fast rapid hill climbing algorithm. At the same time these new heuristics yield qualitatively comparable results. In addition to this, it also offers a novel unpublished rapid Bootstrapping algorithm that is faster by at least one order of magnitude than all other current implementations (RAxML 2.2.3, GARLI, PHYML). Once again, the results obtained by the rapid bootstrapping algorithm are qualitatively comparable to those obtained via the standard RAxML BS algorithm and, more importantly, the deviations in support values between the rapid and the standard RAxML BS algorithm are smaller than those induced by using a different search strategy, e.g., GARLI or PHYML. This rapid BS search can be combined with a rapid ML search on the original alignment and thus allows users to conduct a full ML analysis within one single program run.
RAXML comes in three flavors:
1. raxmlHPC - just the standard sequential version, compile it with gcc for LINUX and MAC.
2. raxmlHPC-PTHREADS - the Pthreads parallelized version of RAxML which is intended for shared-memory and multi-core architectures.
3. raxmlHPC-MPI the MPI-parallelized version for all types of clusters to perform parallel bootstraps, rapid parallel bootstraps, or multiple inferences on the original alignment.
Other compilers: The Intel-compiler icc can produce produces 20-30% faster code than gcc.
- Listed features
- high level design info, how it works, performance - may be a link, or several links
http://wwwkramer.in.tum.de/exelixis/hands-On.html (step by step tutorial for compiling and usage of RAXML)
DNAMA (DNA multicore analysis)
RAXML is installed at Bulgarian HPC under user account.