tree-puzzle 5.2-10 source package in Ubuntu
Changelog
tree-puzzle (5.2-10) unstable; urgency=medium
* Do not try parallel builds
Closes: #878333
-- Andreas Tille <email address hidden> Fri, 13 Oct 2017 07:48:35 +0200
Upload details
- Uploaded by:
- Debian Med
- Uploaded to:
- Sid
- Original maintainer:
- Debian Med
- Architectures:
- any all
- Section:
- science
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Bionic | release | universe | science |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| tree-puzzle_5.2-10.dsc | 2.1 KiB | 406673835a05e208cea555987c945a4d7d62a7286320f9ea99534137f257f1f6 |
| tree-puzzle_5.2.orig.tar.gz | 854.6 KiB | 3396d3b80b03b0600afb479dc33f0bd3e5631298337295a4fa454211ac44c3fb |
| tree-puzzle_5.2-10.debian.tar.xz | 64.0 KiB | d96dbc95c70ead9ac622eb47a5b08ee1866bfbb840d5596e39045628551cabea |
Available diffs
No changes file available.
Binary packages built by this source
- tree-ppuzzle: Parallelized 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.
.
This is the parallelized version of tree-puzzle.
- tree-ppuzzle-dbgsym: No summary available for tree-ppuzzle-dbgsym in ubuntu cosmic.
No description available for tree-ppuzzle-dbgsym in ubuntu cosmic.
- 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: debug symbols for tree-puzzle
- tree-puzzle-doc: 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
