Published in

Oxford University Press (OUP), Bioinformatics, 11(18), p. 1546-1547

DOI: 10.1093/bioinformatics/18.11.1546

Links

Tools

Export citation

Search in Google Scholar

QuickTree: Building Huge Neighbour-Joining Trees of Protein Sequences

Journal article published in 2002 by Kevin Howe, Alex Bateman ORCID, Richard Durbin ORCID
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Green circle
Postprint: archiving allowed
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

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. </fn