1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
|
Source: puzzle
Section: misc
Priority: optional
Maintainer: Stephane Bortzmeyer <bortzmeyer@debian.org>
Standards-Version: 2.4.0.0
Package: puzzle
Architecture: any
Depends: ${shlibs:Depends}
Description: [Biology] Reconstruction of phylogenetic trees by maximum likelihood
It 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. 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, 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.
|
