Paket: tree-puzzle-doc (5.2-11)
Länkar för tree-puzzle-doc
Debianresurser:
Hämta källkodspaketet tree-puzzle:
Ansvariga:
Externa resurser:
- Hemsida [www.tree-puzzle.de]
Liknande paket:
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
Andra paket besläktade med tree-puzzle-doc
|
|
|
|
-
- rec: tree-puzzle
- Reconstruction of phylogenetic trees by maximum likelihood
- eller tree-ppuzzle
- Parallelized reconstruction of phylogenetic trees by maximum likelihood
Hämta tree-puzzle-doc
Arkitektur | Paketstorlek | Installerad storlek | Filer |
---|---|---|---|
all | 391,6 kbyte | 573,0 kbyte | [filförteckning] |