[ ソース: tree-puzzle ]
パッケージ: tree-puzzle-doc (5.3~rc16+dfsg-8)
tree-puzzle-doc に関するリンク
Debian の資源:
tree-puzzle ソースパッケージをダウンロード:
- [tree-puzzle_5.3~rc16+dfsg-8.dsc]
- [tree-puzzle_5.3~rc16+dfsg.orig.tar.xz]
- [tree-puzzle_5.3~rc16+dfsg-8.debian.tar.xz]
メンテナ:
外部の資源:
- ホームページ [www.tree-puzzle.de]
類似のパッケージ:
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
その他の tree-puzzle-doc 関連パッケージ
|
|
|
|
-
- rec: tree-puzzle
- 最尤法による系統樹の再構築
- または tree-ppuzzle
- 最尤法による系統樹の再構築 (並列化版)