1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
|
Source: tree-puzzle
Maintainer: Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
Uploaders: Andreas Tille <tille@debian.org>,
Charles Plessy <plessy@debian.org>
Section: science
Priority: optional
Build-Depends: dh-autoreconf,
debhelper (>= 9),
libopenmpi-dev,
libsprng2-dev
Standards-Version: 3.9.6
Vcs-Browser: http://anonscm.debian.org/viewvc/debian-med/trunk/packages/tree-puzzle/
Vcs-Svn: svn://anonscm.debian.org/debian-med/trunk/packages/tree-puzzle/trunk/
Homepage: http://www.tree-puzzle.de
Package: tree-puzzle
Architecture: any
Depends: ${misc:Depends},
${shlibs:Depends}
Recommends: tree-puzzle-doc
Suggests: phylip,
treetool
Description: Reconstruction of phylogenetic trees by maximum likelihood
TREE-PUZZLE (the new name for PUZZLE) is an interactive console program that
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. TREE-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, TREE-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.
Package: tree-ppuzzle
Architecture: any
Depends: ${misc:Depends},
${shlibs:Depends},
openmpi-bin
Recommends: tree-puzzle-doc
Suggests: phylip,
treetool
Description: Parallelized reconstruction of phylogenetic trees by maximum likelihood
TREE-PUZZLE (the new name for PUZZLE) is an interactive console program that
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. TREE-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, TREE-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.
.
This is the parallelized version of tree-puzzle.
Package: tree-puzzle-doc
Architecture: all
Section: doc
Depends: ${misc:Depends}
Recommends: tree-puzzle | tree-ppuzzle
Description: Reconstruction of phylogenetic trees by maximum likelihood (doc)
TREE-PUZZLE (the new name for PUZZLE) is an interactive console program that
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. TREE-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, TREE-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.
.
This is the documentation package for tree-puzzle
|
