| Paketname | tree-ppuzzle |
| Beschreibung | Parallelized reconstruction of phylogenetic trees by maximum likelihood |
| Archiv/Repository | Offizielles Debian Archiv squeeze (main) |
| Version | 5.2-5 |
| Sektion | science |
| Priorität | optional |
| Installierte Größe | 352 Byte |
| Hängt ab von | libc6 (>= 2.3.6-6~), liblam4, libsprng2, lam-runtime |
| Empfohlene Pakete | tree-puzzle-doc |
| Paketbetreuer | Debian-Med Packaging Team |
| Quelle | tree-puzzle |
| Paketgröße | 142400 Byte |
| Prüfsumme MD5 | ca2e4deae054cbaa22c4e7eada369daa |
| Prüfsumme SHA1 | b401786fc83cc48c1e56a705c60941d7b09f66d8 |
| Prüfsumme SHA256 | ef33d4e30195bb7482106ec78a29408380dfec6365d8d7f423f9e5640ca6ddf3 |
| Link zum Herunterladen | tree-ppuzzle_5.2-5_i386.deb |
| Ausführliche Beschreibung | 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.
|