Paket: quicktree (2.5-6 och andra)

[ Källkod: 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

Andra paket besläktade med quicktree

• dep: libc6 (>= 2.34)

  GNU C-bibliotek: Delade bibliotek
  också ett virtuellt paket som tillhandahålls av libc6-udeb

• sug: hmmer

  profile hidden Markov models for protein sequence analysis

  eller hmmer2

  profile hidden Markov models for protein sequence analysis

Hämta quicktree

Hämtningar för alla tillgängliga arkitekturer

Arkitektur	Version	Paketstorlek	Installerad storlek	Filer
riscv64	2.5-6+b1	21,6 kbyte	53,0 kbyte	[filförteckning]