.TH TREE-PUZZLE 1 "April 20, 2001"
.SH NAME
tree-puzzle \- Reconstruction of phylogenetic trees by maximum likelihood
.SH SYNOPSIS
.B tree-puzzle
.RI
.SH DESCRIPTION
This manual page documents briefly the
.B tree-puzzle
command.
This manual page was written for the Debian GNU/Linux distribution
because the original program does not have a manual page.
.PP
TREE-PUZZLE is the new name for the program previously known as PUZZLE!
.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-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.
.PP
There is also a paralellized version tree-ppuzzle available.
.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-ppuzzle (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).