Please note that versions v0.3.0 through v0.3.3 are affected by a result breaking bug if the input tree is rooted! If you think this may be the case for you, we urgently insist you update to at least version v0.3.4!
There is now a short tutorial available that covers the basic steps of a placement project. You can find it here
The most reliable way to get in touch with us is to head over to the Phylogenetic Placement Google Group. You can also search its history, or the hostory of the RAxML Google Group for your particular question.
Alternatively I’ve created a gitter chat room where I can usually be found during office hours.
This tool is still in an active development. Suggestions, bug reports and constructive comments are more than encuraged! Please do so in the google group.
EPA-ng is a complete rewrite of the Evolutionary Placement Algorithm (EPA), previously implemented in RAxML. It uses libpll and pll-modules to perform maximum likelihood-based phylogenetic placement of genetic sequences on a user-supplied reference tree and alignment.
bfast-fileEPA-ng is used from the command line, as the main use-case is processing large amounts of data using a supercomputing cluster.
Here is a list of the most basic arguments you will use:
| Flag | Long Flag | Meaning |
|---|---|---|
| -s | –ref-msa | reference MSA (fasta) |
| -t | –tree | reference Tree (newick) |
| -q | –query | query sequences (fasta or bfast) |
| -w | –outdir | output directory (default: current directory) |
| –model | model parameter specification | |
| -T | –threads | number of threads to use |
For a full overview of command line options either run EPA-ng with no input, or with the flag -h (or --help).
On a single computer, an example execution might look like this:
epa-ng --ref-msa $REF_MSA --tree $TREE --query $QRY_MSA --model $MODELNote that this will use as many threads as specified by the environment variable OMP_NUM_THREADS. Usually this defaults to the number of cores. Note however, that no speedup is to be expected from hyperthreads, meaning the number of threads should be set to the number of physical cores.
As of version 0.2.0, GTRGAMMA model parameters have to be specified explicitly. There are currently two ways of doing this: Either specify a raxml-ng-style model descriptor (elaborated here), like so:
epa-ng <...> --model GTR{0.7/1.8/1.2/0.6/3.0/1.0}+FU{0.25/0.23/0.30/0.22}+G4{0.47}… or pass a file containing the relevant information, coming from one of the supported tree inference programs.
RECOMMENDED In the case of raxml-ng, pass the [...].bestModel file resulting from an evaluation run to EPA-ng:
raxml-ng --evaluate --msa $REF_MSA --tree $TREE --prefix info --model GTR+G+F
epa-ng <...> --model info.raxml.bestModelThis method has support for pretty much every model that raxml-ng supports, so it is highly recommended you do it this way.
Alternatively we also support parsing the model parameters either from RAxML 8.x info files, or from IQ-TREE report files, though there may be parsing problems as not all models are covered.
For RAxML8.x: pass a RAxML_info-file to the program, where the info file was generated from a call to RAxML option -f e:
raxmlHPC-AVX -f e -s $REF_MSA -t $TREE -n file -m GTRGAMMAX
epa-ng <...> --model RAxML_info.fileOverview of advanced features:
| Flag | Long Flag | Meaning |
|---|---|---|
| -g | –dyn-heur | use dynamic preplacement heuristic (default) |
| -G | –fix-heur | use fixed preplacement heuristic |
| –no-heur | disable preplacement heuristic | |
| –no-pre-mask | disable premasking | |
| -c | –bfast | convert query fasta to binary format |
The description of basic cluster usage starts here
By default, EPA-ng performs placement of a sequence in two stages: first selecting promising branches quickly (preplacement), then evaluating the selected branches in greater detail.
EPA-ng currently offers three ways of selecting these candidates.
The default is the accumulated threshold method, in which branches are added to the set of candidates until the sum of their LWR exceed a user specified threshold. The flag controlling this mode is -g (or --dyn-heur), with a default setting of 0.99999, corresponding to a covered likelihood weight of 99.999%.
The second mode functions identically to the candidate selection mode in the original implementation of the EPA in RAxML. Here again the branches are sorted by the LWR of the placement of a sequence. Then, the top x% of the total number of branches are selected into the set of candidates. Like in RAxML, this behavior is controlled via the -G (or --fix-heur) flag.
The third mode works identically to the baseball heuristic from pplacer, with default settings (–strike-box 3.0, –max-strikes 6, –max-pitches 40) and is enabled using the --baseball-heur flag.
Lastly, to disable the preplacement completely, you can simply supply the --no-heur flag. Be warned however: doing so will be significantly more computationally demanding. Our advice is to use the heuristic, as it sacrifices only insignificant amounts of accuracy for greatly improved speed.
By default, EPA-ng enables premasking, which works similarily to the same option in pplacer: If a site of the alignment is all-gaps in either the reference OR query alignment, throw it out. Further, for each query sequence, ignore the leading, and trailing gap columns (this is where we differ from pplacer, as they ignore ALL query gap columns).
This reduces both runtime and memory footprint greatly, depending on the data. For short read data, the impact will be massive, as typically query alignments will be mostly all-gap.
To use distributed parallelism in EPA-ng, first we must re-compile the program with MPI enabled. This requires a version of MPI to be loaded/installed on your system. The only additional requirement EPA-ng has, is that the compiler that is loaded in conjunction with MPI satisfies the minimum version requirements. Often this can be assured by the order in which the relevant modules are loaded on the cluster: first MPI, then the compiler. However we reccomend you contact your support team should this cause issues for you.
The actual compilation is very straight-forward:
make clean && make EPA_HYBRID=1This will attempt to compile the program with both MPI and OpenMP, as the most efficient way to run the program is to map one MPI rank per node (good alternative: one rank per socket!), each rank starting as many threads as there are physical cores.
In your job submission script, you can then call the program in a highly similar way to before:
mpirun epa-ng --ref-msa $REF_MSA --tree $TREE -q query.fasta -w ./some/output/dir.bfastYou may also explicitly convert the input query fasta file to our internal fasta format. This format is binary encoded (reducing the size by half) and randomly accessible. Using this format is reccomended for use under MPI, as it increases parallel efficiency.
To convert the fasta file, simply run the program with the query file specified thusly:
epa-ng --bfast query.fasta --outdir $OUTThis will produce a file called query.fasta.bfast in the specified output directory.
This repository includes a test data set which can be found under test/data/neotrop. Consult the README located there for usage examples.
If you use EPA-ng, please cite the following paper:
Pierre Barbera, Alexey M Kozlov, Lucas Czech, Benoit Morel, Diego Darriba, Tomáš Flouri, Alexandros Stamatakis; EPA-ng: Massively Parallel Evolutionary Placement of Genetic Sequences, Systematic Biology, syy054, https://doi.org/10.1093/sysbio/syy054