./biology/puzzle, Maximum likelihood analysis of molecular sequence data

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]

Branch: pkgsrc-2010Q2, Version: 5.1nb1, Package name: puzzle-5.1nb1, Maintainer: babafou

PUZZLE is a computer program to reconstruct phylogenetic trees
from molecular sequence data by maximum likelihood. It implements
a fast tree search algorithm, quartet puzzling, that allows
analysis of large data sets and automatically assigns estimations
of support to each internal branch. PUZZLE also computes pairwise
maximum likelihood distances as well as branch lengths for user
specified trees. Branch lengths can also be calculated under the
clock-assumption. In addition, PUZZLE offers a novel method,
likelihood mapping, to investigate the support of a hypothesized
internal branch without computing an overall tree and to
visualize the phylogenetic content of a sequence alignment.
PUZZLE also conducts a number of statistical tests on the data
set (chi-square test for homogeneity of base composition,
likelihood ratio to test the clock hypothesis, Kishino-Hasegaw a
test). The models of substitution provided by PUZZLE are TN, HKY,
F84, SH for nucleotides, Dayhoff, JTT, mtREV24, BLOSUM 62 for
amino acids, and F81 for two-state data. Rate heterogeneity is
modelled by a discrete Gamma distribution and by allowing
invariable sites. The corresponding parameters can be inferred
from the data set.


Required to run:
[parallel/mpi-ch]

Required to build:
[parallel/openpa]

Master sites:

SHA1: f55464587cd04c9afb0eb83231318d91b8614798
RMD160: 8287cc27c5c0da181c886304ecdc0290504778d1
Filesize: 597.867 KB

Version history: (Expand)