QuickTree: Building huge neighbour-joining trees of protein sequences

246Citations
Citations of this article
162Readers
Mendeley users who have this article in their library.

This article is free to access.

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 27 000 HIV GP120 glycoprotein sequences) that would be infeasible using other popular methods.

Cite

CITATION STYLE

APA

Howe, K., Bateman, A., & Durbin, R. (2002). QuickTree: Building huge neighbour-joining trees of protein sequences. Bioinformatics, 18(11), 1546–1547. https://doi.org/10.1093/bioinformatics/18.11.1546

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free