Ubuntu
tree-puzzle package

tree-puzzle 5.2-8 source package in Ubuntu

Changelog

tree-puzzle (5.2-8) unstable; urgency=low

  * debian/upstream: Add publications
  * cme fix dpkg-control
  * debhelper 9
  * fix clean target when running test suite
  * Use dh_autoreconf to update for new architectures
    Closes: #765262
  * Try hard to run the test suite
  * DEP5 copyright
  * Enable separate arch independet builds
    Closes: #806119

 -- Andreas Tille <email address hidden>  Wed, 25 Nov 2015 14:03:11 +0100

Upload details

Uploaded by:
Debian Med
Uploaded to:
Sid
Original maintainer:
Debian Med
Architectures:
any all
Section:
science
Urgency:
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
tree-puzzle_5.2-8.dsc 2.1 KiB 844ddc551116d2c9246a8064fe47e629c2bc6bd71017bfcc7d9edd23b2f8c399
tree-puzzle_5.2.orig.tar.gz 854.6 KiB 3396d3b80b03b0600afb479dc33f0bd3e5631298337295a4fa454211ac44c3fb
tree-puzzle_5.2-8.debian.tar.xz 64.1 KiB f913245e41a7caa459622891d374375c30a75928f373d22a8f9c345251839bf8

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 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: debug symbols for package tree-puzzle

 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-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