Skip to content
Sections
>> Trisquel >> Paket >> etiona >> science >> tree-puzzle
etiona  ] [  nabia  ] [  aramo  ]
[ Källkod: tree-puzzle  ]

Paket: tree-puzzle (5.2-10)

Länkar för tree-puzzle

tree-puzzle

Trisquelresurser:

Hämta källkodspaketet tree-puzzle:

Ansvarig:

Original Maintainers:

  • Debian Med Packaging Team (E-postarkiv)
  • Andreas Tille
  • Charles Plessy

Externa resurser:

Liknande paket:

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.

Andra paket besläktade med tree-puzzle

  • beror
  • rekommenderar
  • föreslår
  • dep: libc6 (>= 2.7)
    GNU C Library: Shared libraries
    också ett virtuellt paket som tillhandahålls av libc6-udeb
  • dep: libsprng2
    SPRNG Scalable Parallel RNG library -- library package
  • 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-puzzle

Hämtningar för alla tillgängliga arkitekturer
Arkitektur Paketstorlek Installerad storlek Filer
amd64 126,5 kbyte308 kbyte [filförteckning]
i386 127,0 kbyte328 kbyte [filförteckning]