Skip to content
Sections
>> Trisquel >> Packages >> aramo >> science >> tree-ppuzzle
[  etiona  ] [  nabia  ] [  aramo  ]
[ Source: tree-puzzle  ]

Package: tree-ppuzzle (5.3~rc16+dfsg-9)

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.

Other Packages Related to tree-ppuzzle

  • depends
  • recommends
  • suggests
  • dep: libc6 (>= 2.34)
    GNU C Library: Shared libraries
    also a virtual package provided by libc6-udeb
  • dep: libopenmpi3 (>= 4.1.2)
    high performance message passing library -- shared library
  • dep: libsprng2
    SPRNG Scalable Parallel RNG library -- library package
  • dep: openmpi-bin
    high performance message passing library -- binaries
  • rec: tree-puzzle-doc
    Reconstruction of phylogenetic trees by maximum likelihood (doc)
  • sug: phylip
    package of programs for inferring phylogenies
  • sug: treetool
    Package not available

Download tree-ppuzzle

Download for all available architectures
Architecture Package Size Installed Size Files
amd64 160.7 kB378 kB [list of files]
arm64 155.4 kB345 kB [list of files]
armhf 165.0 kB309 kB [list of files]
ppc64el 203.6 kB542 kB [list of files]