tree-puzzle 5.3~rc16+dfsg-9build1 source package in Ubuntu
Changelog
tree-puzzle (5.3~rc16+dfsg-9build1) noble; urgency=medium * No-change rebuild against libopenmpi3t64 -- Steve Langasek <email address hidden> Wed, 13 Mar 2024 18:37:46 +0000
Upload details
- Uploaded by:
- Steve Langasek
- Uploaded to:
- Noble
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any all
- Section:
- science
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| tree-puzzle_5.3~rc16+dfsg.orig.tar.xz | 576.8 KiB | 825526224b27813aebd2d9d5ccec5195116964225b73d8ffc1252d3676b0a420 |
| tree-puzzle_5.3~rc16+dfsg-9build1.debian.tar.xz | 30.7 KiB | d7f51e0ecec68ad98158c972fbaf92d5e22ec3888a16cbfad761485941992d3a |
| tree-puzzle_5.3~rc16+dfsg-9build1.dsc | 2.3 KiB | 135a8e482243dc6de9544cf549a94b4797e75792767b56358b0e1cc40f724ebe |
Available diffs
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
