tree-puzzle 5.3~rc16+dfsg-9 source package in Ubuntu
Changelog
tree-puzzle (5.3~rc16+dfsg-9) unstable; urgency=medium
[ Chris Lamb ]
* make the build reproducible on i386
Closes: #1005901
[ Andreas Tille ]
* Fix typo override_dh_build
* Lintian-override for *.a data files
* Standards-Version: 4.6.0 (routine-update)
* Remove trailing whitespace in debian/changelog (routine-update)
* Apply multi-arch hints.
+ tree-puzzle-doc: Add Multi-Arch: foreign.
-- Andreas Tille <email address hidden> Thu, 17 Feb 2022 07:12:29 +0100
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 | |
|---|---|---|---|---|
| Mantic | release | universe | science | |
| Lunar | release | universe | science | |
| Jammy | release | universe | science |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| tree-puzzle_5.3~rc16+dfsg-9.dsc | 2.2 KiB | c4cf4ba093ed385f13c962df4b0e554c700f48484b18dc68f43c070c842b6535 |
| tree-puzzle_5.3~rc16+dfsg.orig.tar.xz | 576.8 KiB | 825526224b27813aebd2d9d5ccec5195116964225b73d8ffc1252d3676b0a420 |
| tree-puzzle_5.3~rc16+dfsg-9.debian.tar.xz | 30.5 KiB | 5e8d99b1b304a3396dc3907b8f22dfcd7684a4c7262b50873afd5f33c50b6bdb |
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: debug symbols for tree-ppuzzle
- 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
