quicktree
Neighbor-Joining algorithm for phylogenies
Description
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 programsUpload more screenshots
Please help extend the collection of screenshots. Just make a screenshot and upload it here. You don't need to register or anything.
Upload a screenshotHint: upload an image here from your clipboard with Ctrl-V
Homepage
https://github.com/khowe/quicktree/
Install this software package
If the package is available for the distribution you are currently using on your computer then install the software by clicking on…
Install quicktree