Tag: Minimum Evolution Tree

FastTree 2.1.11 – Cmpute Large Minimum Evolution Trees with Profiles

FastTree 2.1.11

:: DESCRIPTION

FastTree infers approximately-maximum-likelihood phylogenetic trees from alignments of nucleotide or protein sequences. FastTree can handle alignments with up to a million of sequences in a reasonable amount of time and memory.

::DEVELOPER

by Morgan N. Price in The Arkin laboratory .

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux / Windows

:: DOWNLOAD

FastTree

:: MORE INFORMATION

Citation

Price, M.N., Dehal, P.S., and Arkin, A.P. (2009)
FastTree: Computing Large Minimum-Evolution Trees with Profiles instead of a Distance Matrix.
Molecular Biology and Evolution 26:1641-1650, doi:10.1093/molbev/msp077.

Price, M.N., Dehal, P.S., and Arkin, A.P. (2010)
FastTree 2 — Approximately Maximum-Likelihood Trees for Large Alignments.
PLoS ONE, 5(3):e9490. doi:10.1371/journal.pone.0009490.

METREE 1.2 – Infer and Test Minimum Evolution Trees

METREE 1.2

:: DESCRIPTION

METREE is intended to find the minimum evolution (ME) tree that has the smallest value of the sum of branch lengths (S) for a set of  sequences, identify a set of trees whose S are not significantly different from that of the ME tree, and print out the resulting trees in a publishable form. The branch lengths for each topology are estimated by the ordinary least-squares method from a matrix of evolutionary distances.

::DEVELOPER

Andrey Rzhetsky

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Windows

:: DOWNLOAD

 METREE

:: MORE INFORMATION

Citation:

Comput Appl Biosci. 1994 Jul;10(4):409-12.
METREE: a program package for inferring and testing minimum-evolution trees.
Rzhetsky A, Nei M.