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
|
.TH TREE-PPUZZLE 1 "April 20, 2001"
.SH NAME
tree-ppuzzle \- Reconstruction of phylogenetic trees by maximum likelihood (parallelized version)
.SH SYNOPSIS
.B tree-ppuzzle
.RI
.SH DESCRIPTION
This manual page documents briefly the
.B tree-ppuzzle
command.
This manual page was written for the Debian GNU/Linux distribution
because the original program does not have a manual page.
.PP
TREE-PPUZZLE is the new name for the program previously known as PPUZZLE!
.PP
\fBtree-puzzle\fP 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-PPUZZLE 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-PPUZZLE 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.
.PP
This program is the paralelized version of tree-puzzle.
.SH OPTIONS
There are no options. For usage please look at /usr/share/doc/tree-puzzle/tree-puzzle.pdf.
.SH SEE ALSO
.BR phylip (1),
.BR treetool (1).
.BR tree-puzzle (1).
.PP
This manual page was written by Dr. Guenter Bechly <gbechly@debian.org>,
for the Debian GNU/Linux system (but may be used by others).
|
