Paketti: tree-ppuzzle (5.2-10)
Links for tree-ppuzzle
Trisquel-palvelut:
Imuroi lähdekoodipaketti tree-puzzle:
Ylläpitäjä:
Original Maintainers:
- Debian Med Packaging Team (Mail Archive)
- Andreas Tille
- Charles Plessy
External Resources:
- Kotisivu [www.tree-puzzle.de]
Samankaltaisia paketteja:
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.
Muut pakettiin tree-ppuzzle liittyvät paketit
|
|
|
-
- dep: libc6 (>= 2.7)
- GNU C Library: Shared libraries
myös näennäispaketti, jonka toteuttaa 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
- Paketti ei saatavilla
Imuroi tree-ppuzzle
| Arkkitehtuuri | Paketin koko | Koko asennettuna | Tiedostot |
|---|---|---|---|
| amd64 | 142.8 kt | 348 kt | [tiedostoluettelo] |
| i386 | 143.7 kt | 372 kt | [tiedostoluettelo] |