Source: tree-puzzle Maintainer: Debian Med Packaging Team Uploaders: Andreas Tille , Charles Plessy Section: science Priority: optional Build-Depends: debhelper-compat (= 13), libopenmpi-dev, libsprng2-dev Standards-Version: 4.5.1 Vcs-Browser: https://salsa.debian.org/med-team/tree-puzzle Vcs-Git: https://salsa.debian.org/med-team/tree-puzzle.git Homepage: http://www.tree-puzzle.de Rules-Requires-Root: no Package: tree-puzzle Architecture: any Depends: ${misc:Depends}, ${shlibs:Depends} 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 Depends: ${misc:Depends}, ${shlibs:Depends}, openmpi-bin Recommends: tree-puzzle-doc 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 Depends: ${misc:Depends} Recommends: tree-puzzle | tree-ppuzzle Description: 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