| Paketname | tree-puzzle |
| Beschreibung | 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 | 324 Byte |
| Hängt ab von | libc6 (>= 2.3), libsprng2 |
| Empfohlene Pakete | tree-puzzle-doc |
| Paketbetreuer | Debian-Med Packaging Team |
| Quelle | |
| Paketgröße | 129124 Byte |
| Prüfsumme MD5 | c792bb4d33836d8e556740190b5b2225 |
| Prüfsumme SHA1 | 6589685253bb3d91bc42c4b580f23227b5bedcf4 |
| Prüfsumme SHA256 | e418ce3fdada2be8920f85bade3a058fafc125f1300ac971525a9f64e214f970 |
| Link zum Herunterladen | tree-puzzle_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.
|