Skip to content
Sections
>> Trisquel >> Paquets >> etiona >> science >> tree-ppuzzle
etiona  ] [  nabia  ] [  aramo  ]
[ Paquet source : tree-puzzle  ]

Paquet : tree-ppuzzle (5.2-10)

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.

Autres paquets associés à tree-ppuzzle

  • dépendances
  • recommandations
  • suggestions
  • dep: libc6 (>= 2.7)
    GNU C Library: Shared libraries
    un paquet virtuel est également fourni par libc6-udeb
  • dep: libopenmpi2
    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
    Paquet indisponible

Télécharger tree-ppuzzle

Télécharger pour toutes les architectures proposées
Architecture Taille du paquet Espace occupé une fois installé Fichiers
amd64 142,8 ko348 ko [liste des fichiers]
i386 143,7 ko372 ko [liste des fichiers]