ml-burg(1) [debian man page]

ml-burg(1)						      General Commands Manual							ml-burg(1)

NAME

       ml-burg - a tree parser generator for Standard ML

SYNOPSIS

       ml-burg file.burg

DESCRIPTION

       This manual page documents briefly the ml-burg command.	This manual page was written for the Debian distribution because the original pro-
       gram does not have a manual page.

       The ml-burg program generates a Standard ML program to perform bottom-up rewriting of an input tree. Cost information associated with  each
       rewrite rule is used to derive the minimum rewrite cost for the entire tree. A successful reduction corresponds to rewriting the input tree
       to a special non-terminal symbol called the start non-terminal.	Upon successful reduction, facilities are provided to walk the tree  emit-
       ting semantic actions corresponding to the rules that matched.

       When ml-burg is presented with file.burg, the file file.sml is generated.

SEE ALSO

       sml(1), ml-lex(1), ml-yacc(1), ml-makedepend(1), ml-build(1).
       The  programs  are  documented  fully  by  The  ML-Burg	--  Documentation,  Florent  Guillaume	and  Lal  George,  which  is  available in
       /usr/share/doc/ml-burg/doc.pdf.

AUTHOR

       This manual page was written by Aaron Matthew Read <amread@nyx.net>, for the Debian GNU/Linux system (but may be used by others)

								 November 14, 2002							ml-burg(1)

TREE-PPUZZLE(1) 					      General Commands Manual						   TREE-PPUZZLE(1)

NAME

       tree-ppuzzle - Reconstruction of phylogenetic trees by maximum likelihood (parallelized version)

SYNOPSIS

       tree-ppuzzle

DESCRIPTION

       This  manual  page  documents briefly the tree-ppuzzle command.	This manual page was written for the Debian GNU/Linux distribution because
       the original program does not have a manual page.

       TREE-PPUZZLE is the new name for the program previously known as PPUZZLE!

       tree-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-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  addi-
       tion,  TREE-PPUZZLE offers a novel method, likelihood mapping, to investigate the support of a hypothesized internal branch without comput-
       ing an overall tree and to visualize the phylogenetic content of a sequence alignment.

       This program is the paralelized version of tree-puzzle.

OPTIONS

       There are no options. For usage please look at /usr/share/doc/tree-puzzle/tree-puzzle.pdf.

SEE ALSO

       phylip(1), treetool(1).	tree-puzzle(1).

       This manual page was written by Dr. Guenter Bechly <gbechly@debian.org>, for the Debian GNU/Linux system (but may be used by others).

								  April 20, 2001						   TREE-PPUZZLE(1)