Skip to main content
Journal ArticleOPEN ACCESS

QuickJoin - Fast neighbour-joining tree reconstruction

Bioinformatics (2004) 20(17) 3261-3262
DOI: 10.1093/bioinformatics/bth359
27Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Summary: We have built a tool for fast construction of very large phylogenetic trees. The tool uses heuristics for speeding up the neighbour-joining algorithm - while still constructing the same tree as the original neighbour-joining algorithm - making it possible to construct trees for 8000 species in <10 min on a single desktop PC. In comparison, the same task takes more than 30 min using the QuickTree neighbour-joining implementation. © Oxford University Press 2004; all rights reserved.

Cite

CITATION STYLE

APA

Mailund, T., & Pedersen, C. N. S. (2004). QuickJoin - Fast neighbour-joining tree reconstruction. Bioinformatics, 20(17), 3261–3262. https://doi.org/10.1093/bioinformatics/bth359

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