Paket: quicktree (2.5-5)

[ Kaynak: 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 ile İlgili Diğer Paketler

• dep: libc6 (>= 2.29)

  GNU C Library: Shared libraries
  ayrıca şunun tarafından sağlanan bir sanal paket libc6-udeb

• sug: hmmer

  profile hidden Markov models for protein sequence analysis

  ya da hmmer2

  profile hidden Markov models for protein sequence analysis

quicktree indir

Tüm mevcut mimariler için indir

Mimari	Paket Boyutu	Kurulu Boyut	Dosyalar
amd64	20,5 kB	56,0 kB	[dosya listesi]
arm64	19,2 kB	56,0 kB	[dosya listesi]
armel	19,8 kB	56,0 kB	[dosya listesi]
armhf	17,5 kB	44,0 kB	[dosya listesi]
i386	21,3 kB	60,0 kB	[dosya listesi]
mips64el	21,1 kB	64,0 kB	[dosya listesi]
mipsel	20,9 kB	62,0 kB	[dosya listesi]
ppc64el	23,3 kB	85,0 kB	[dosya listesi]
s390x	19,7 kB	60,0 kB	[dosya listesi]