alla flaggor
jessie  ] [  stretch  ] [  buster  ] [  sid  ]
[ Källkod: tree-puzzle  ]

Paket: tree-puzzle-doc (5.2-11)

Länkar för tree-puzzle-doc

Screenshot

Debianresurser:

Hämta källkodspaketet tree-puzzle:

Ansvariga:

Externa resurser:

Liknande paket:

Reconstruction of phylogenetic trees by maximum likelihood (doc)

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 documentation package for tree-puzzle

Märken: Field: Biologi, Bioinformatics, Made Of: made-of::pdf, role::documentation

Andra paket besläktade med tree-puzzle-doc

  • beror
  • rekommenderar
  • föreslår
  • enhances

Hämta tree-puzzle-doc

Hämtningar för alla tillgängliga arkitekturer
Arkitektur Paketstorlek Installerad storlek Filer
all 391,6 kbyte573,0 kbyte [filförteckning]