tree-puzzle 5.2-8build1 source package in Ubuntu
Changelog
tree-puzzle (5.2-8build1) xenial; urgency=medium * No-change rebuild for openmpi transition. -- Matthias Klose <email address hidden> Sun, 07 Feb 2016 12:57:48 +0000
Upload details
- Uploaded by:
- Matthias Klose
- Uploaded to:
- Xenial
- Original maintainer:
- Debian Med
- Architectures:
- any all
- Section:
- science
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Xenial | release | universe | science |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
tree-puzzle_5.2.orig.tar.gz | 854.6 KiB | 3396d3b80b03b0600afb479dc33f0bd3e5631298337295a4fa454211ac44c3fb |
tree-puzzle_5.2-8build1.debian.tar.xz | 64.2 KiB | 1d8e74941bb20cdfcaa8fa7eb7d6ba86f4bb9b05bc7839952c025b7c34bb9231 |
tree-puzzle_5.2-8build1.dsc | 2.1 KiB | 92fb6f303e7604e98a077e8c9d0c8c65bea8df10714e582e874c6b36d60cfa44 |
Available diffs
- diff from 5.2-8 (in Debian) to 5.2-8build1 (322 bytes)
Binary packages built by this source
- tree-ppuzzle: No summary available for tree-ppuzzle in ubuntu yakkety.
No description available for tree-ppuzzle in ubuntu yakkety.
- tree-ppuzzle-dbgsym: debug symbols for package tree-ppuzzle
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 parallelized version of tree-puzzle.
- tree-puzzle: Reconstruction of phylogenetic trees by maximum likelihood
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.
- tree-puzzle-dbgsym: No summary available for tree-puzzle-dbgsym in ubuntu zesty.
No description available for tree-puzzle-dbgsym in ubuntu zesty.
- tree-puzzle-doc: No summary available for tree-puzzle-doc in ubuntu yakkety.
No description available for tree-puzzle-doc in ubuntu yakkety.