Paket: tree-ppuzzle (5.3~rc16+dfsg-12 och andra)

Länkar för tree-ppuzzle

eLxr Patch Tracker

Hämta källkodspaketet tree-puzzle:

Ansvariga:

Externa resurser:

Hemsida [www.tree-puzzle.de]

Liknande paket:

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.

Andra paket besläktade med tree-ppuzzle

beror

rekommenderar

föreslår

enhances

dep: libc6 (>= 2.34)

GNU C Library: Shared libraries
också ett virtuellt paket som tillhandahålls av libc6-udeb
dep: libopenmpi40 (>= 5.0.6)

high performance message passing library -- shared library
dep: libsprng2

SPRNG Scalable Parallel RNG library -- library package
dep: mpi-default-bin

Standard MPI runtime programs (metapackage)

rec: tree-puzzle-doc

Reconstruction of phylogenetic trees by maximum likelihood (doc)

sug: phylip

package of programs for inferring phylogenies
sug: treetool

Paketet inte tillgängligt

Hämta tree-ppuzzle

Hämtningar för alla tillgängliga arkitekturer
Arkitektur	Version	Paketstorlek	Installerad storlek	Filer
amd64	5.3~rc16+dfsg-12+b1	183,4 kbyte	441,0 kbyte	[filförteckning]
arm64	5.3~rc16+dfsg-12+b1	167,8 kbyte	429,0 kbyte	[filförteckning]