[ aramo ]
[ 原始碼： quicktree ]
套件： quicktree (2.5-5)
quicktree 的相關超連結
Trisquel 的資源：
下載原始碼套件 quicktree：
維護者：
Original Maintainers:
- Debian Med Packaging Team (郵件存檔)
- Steffen Moeller
外部的資源：
- 主頁 [github.com]
相似套件：
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 Library: Shared libraries
同時作為一個虛擬套件由這些套件提供： libc6-udeb