套件：quicktree（2.5-5）

[ 原始碼： quicktree  ]

Neighbor-Joining algorithm for phylogenies

QuickTree is an efficient implementation of the Neighbor-Joining algorithm (PMID: 3447015), capable of reconstructing phylogenies from huge alignments in time less than the age of the universe.

QuickTree accepts both distance matrix and multiple-sequence-aligment inputs. The former should be in PHYLIP format. The latter should be in Stockholm format, which is the native alignment format for the Pfam database. Alignments in various formats can be converted to Stockholm format with the sreformat program, which is part of the HMMer package (hmmer.org).

The tress are written to stdout, in the Newick/New-Hampshire format use by PHYLIP and many other programs

其他與 quicktree 有關的套件

• dep: libc6 (>= 2.29)

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

• sug: hmmer

  profile hidden Markov models for protein sequence analysis

  或者 hmmer2

  profile hidden Markov models for protein sequence analysis

下載 quicktree

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

硬體架構	套件大小	安裝後大小	檔案
amd64	20。5 kB	56。0 kB	[檔案列表]
arm64	19。2 kB	56。0 kB	[檔案列表]
armel	19。8 kB	56。0 kB	[檔案列表]
armhf	17。5 kB	44。0 kB	[檔案列表]
i386	21。3 kB	60。0 kB	[檔案列表]
mips64el	21。1 kB	64。0 kB	[檔案列表]
mipsel	20。9 kB	62。0 kB	[檔案列表]
ppc64el	23。3 kB	85。0 kB	[檔案列表]
s390x	19。7 kB	60。0 kB	[檔案列表]