Ubuntu
tree-puzzle package

tree-puzzle 5.2-7build1 source package in Ubuntu

Changelog

tree-puzzle (5.2-7build1) trusty; urgency=medium

  * No-change rebuild for libopenmpi1.3 -> libopenmpi1.6 transition.
 -- Logan Rosen <email address hidden>   Sat, 14 Dec 2013 23:09:49 -0500

Upload details

Uploaded by:
Logan Rosen
Uploaded to:
Trusty
Original maintainer:
Debian Med
Architectures:
any all
Section:
science
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
tree-puzzle_5.2.orig.tar.gz 854.6 KiB 3396d3b80b03b0600afb479dc33f0bd3e5631298337295a4fa454211ac44c3fb
tree-puzzle_5.2-7build1.debian.tar.gz 86.4 KiB c7148e47d6d39b395d98dc93b5d939a1ec3116f60f7c9bd8bb003837ce542ac2
tree-puzzle_5.2-7build1.dsc 1.8 KiB 57e3f4e94ce1151c6cd7a9230438bdbfe35643ce0014d99937a7c58127446ed4

Available diffs

View changes file

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-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-doc: 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 documentation package for tree-puzzle