Skip to content

Latest commit

 

History

History
57 lines (43 loc) · 3.27 KB

methods-tree-computation2-software.md

File metadata and controls

57 lines (43 loc) · 3.27 KB

Tree Computation Part 2 - Software

FastTree, IQ-tree, RAxML and PhyML all compute ML trees; BEAST is the only program we use that computes Bayesian trees.

FastTree

  • Fast, as you may have picked up from the name. Typically terminates within minutes, even with thousands of sequences.
  • Computes only one tree, so the results of FastTree are questionable not so much because of the accuracy of the tree, but because it doesn't give a way to assess the quality of the result (e.g. by likelihood or empirical support).
  • Anecdotally, seems reasonably accurate at computing the initial bifurcations, i.e. identifying major clades. Might get confused by sequences that could go either way. For instance, in the following example, it's clear the sequences 1 and 3 belong to different clades, but FastTree might get confused by where sequence 2 should go:
  • Again, anecdotally, FastTree still seems to produce similar results to ML tree programs if the sequences are long enough (>1000 nucleotides), because longer sequences have more "phylogenetic signal" (it's easier for converge to a transition matrix for the chosen nucleotide substitution model, because there are more sites).
sequence1: AAAAAA
sequence2: AAAGGG
sequence3: GGGGGG

IQTree

  • ML-based.
  • Not terribly fast. It could be faster than RAxML; I've never really tested it in large runs.
  • From some small test runs, IQ-Tree and FastTree seem to produce the same results, but IQ-Tree is usually slower.
  • I personally prefer RAxML, because IQTree converts all special characters into underscores; i.e. names like A/virus_name/2015-12-30 becomes A_virus_name_2015_12_30. This plays merry hell with any kind of computational downstream analysis.

Basic example cmd:

iqtree -s <input_filename> -nt AUTO

Recommended naive usage

iqtree -s <input_filename> -nt AUTO -m TEST -redo -pre my_prefix
  • -m <model>: Use -m TEST to automatically determine the best-fit model, or -m MF, for ModelFinder (not sure what that is...)
  • -redo: override previous runs.
  • -pre: prefix of output files, because IQ-tree spits out a lot of them.
  • s <input filename> : input filename.
  • nt <no. of threads>: integer, specifying no. of threads. Use AUTO for, well, auto.

Notes:

  • I think the only special char supported by IQ-tree is '_'. Any other special chars get converted to '_' automatically.
  • Deal with duplicate names first before running!
  • Quickstart guide: http://www.iqtree.org/doc/Quickstart

RAxML

  • Very slow, so only used in production when we have to compute publication-quality trees, with a certain number of bootstrap iterations. Only use on the HPC!
  • Has PTHREADS for multiple-CPU parrallelization, and an SSE-extension to speed things up just that much faster - but still slow.
  • Will only terminate within a reasonable amount of time for <1000 sequences (and that's still pushing it).

BEAST

  • Bayesian paradigm, so you'll get something like P(Tree|Models, ModelParams).
  • With a nice point-and-click interface, so probably the most user-friendly. Also has helper programs BEAUTi and Tracer.
  • Also very slow, but anecdotally faster than RAxML. Send your jobs to M3 for production runs.
  • Has GPU support, which on benchmark tests, gives a ~4x speedup on M3's K80 GPUs based on benchmark tests.