QuickTree: building huge Neighbour-Joining trees of protein sequences
- 1 November 2002
- journal article
- research article
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 18 (11) , 1546-1547
- https://doi.org/10.1093/bioinformatics/18.11.1546
Abstract
Summary: We have written a fast implementation of the popular Neighbor-Joining tree building algorithm. QuickTree allows the reconstruction of phylogenies for very large protein families (including the largest Pfam alignment containing 27000 HIV GP120 glycoprotein sequences) that would be infeasible using other popular methods. Availability: The source-code for QuickTree, written in ANSI~C, is freely available via the world wide web at http://www.sanger.ac.uk/Software/analysis/quicktree Contact: klh@sanger.ac.uk * To whom correspondence should be addressed.Keywords
This publication has 0 references indexed in Scilit: