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

[ Källkod: tree-puzzle  ]

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.

Märken: Field: Biologi, Bioinformatics, Implemented in: implemented-in::c, interface::commandline, Role: Program, Scope: Utility, Purpose: use::analysing, use::comparing, Supports Format: Plain Text, Works with: Behöver ett märke till

Andra paket besläktade med tree-ppuzzle

• dep: libc6 (>= 2.34)

  GNU C-bibliotek: Delade bibliotek
  också ett virtuellt paket som tillhandahålls av libc6-udeb

• dep: libmpich12

  Shared libraries for MPICH

• 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	Paketstorlek	Installerad storlek	Filer
armel	176,1 kbyte	451,0 kbyte	[filförteckning]