control 3.25 KB
Newer Older
1 2 3
Source: tree-puzzle
Section: science
Priority: optional
4
Maintainer: Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
5
DM-Upload-Allowed: yes
6
Uploaders: Andreas Tille <tille@debian.org>, Charles Plessy <plessy@debian.org>
7 8
Build-Depends: cdbs, autotools-dev, quilt, debhelper (>=7), libopenmpi-dev, libsprng2-dev
Standards-Version: 3.8.3
9 10 11 12 13 14
Homepage: http://www.tree-puzzle.de
Vcs-Browser: http://svn.debian.org/wsvn/debian-med/trunk/packages/tree-puzzle/?rev=0&sc=0
Vcs-Svn: svn://svn.debian.org/svn/debian-med/trunk/packages/tree-puzzle/trunk/

Package: tree-puzzle
Architecture: any
15
Depends:  ${misc:Depends}, ${shlibs:Depends}
16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32
Recommends: tree-puzzle-doc
Suggests: phylip, treetool
Description: 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.

Package: tree-ppuzzle
Architecture: any
Recommends: tree-puzzle-doc
33
Depends:  ${misc:Depends}, ${shlibs:Depends}, openmpi-bin
34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51
Suggests: phylip, treetool
Description: 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.

Package: tree-puzzle-doc
Architecture: all
Section: doc
52
Depends: ${misc:Depends}, 
53 54 55 56 57 58 59 60 61 62 63 64 65 66
Recommends: tree-puzzle | tree-ppuzzle
Description: 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