QuickJoin---fast neighbour-joining tree reconstruction

Authors:
Thomas Mailund;Christian N. S. Pedersen
Affiliations:
Bioinformatics Research Center (BiRC), University of Aarhus, Høegh-Guldbergs Grade 10, Bldg. 090, DK-8000 Århus C, Denmark;Bioinformatics Research Center (BiRC), University of Aarhus, Høegh-Guldbergs Grade 10, Bldg. 090, DK-8000 Århus C, Denmark
Venue:
Bioinformatics
Year:
2004

Citing 0
Cited 4

Rapid Neighbour-Joining

WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
Accelerating the neighbor-joining algorithm using the adaptive bucket data structure

ISBRA'08 Proceedings of the 4th international conference on Bioinformatics research and applications
Large-scale neighbor-joining with NINJA

WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics
Fast neighbor joining

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Quantified Score

Hi-index	3.85

Visualization

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 Availability: The source code for QuickJoin is available from http://www.birc.dk/Software/QuickJoin under the GNU Public License (GPL).