套件：tree-ppuzzle（5.3~rc16+dfsg-8）

[ 原始碼： tree-puzzle  ]

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.

標籤: 領域: 生物學, 生物資訊學, 實做語言: implemented-in::c, interface::commandline, 角色: 程式, 範圍: 實用程式, Purpose: use::analysing, use::comparing, 支援的格式: 純文字, 處理: 需要一個額外的標籤

其他與 tree-ppuzzle 有關的套件

• dep: libc6 (>= 2.29)

  GNU C 函式庫：共用函式庫
  同時作為一個虛擬套件由這些套件填實： libc6-udeb

• dep: libopenmpi3 (>= 4.1.0)

  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

  套件暫時不可用

下載 tree-ppuzzle

下載可用於所有硬體架構的

硬體架構	套件大小	安裝後大小	檔案
arm64	170。9 kB	412。0 kB	[檔案列表]