WABI 2008: Algorithms in Bioinformatics pp 113-122

Rapid Neighbour-Joining

  • Martin Simonsen
  • Thomas Mailund
  • Christian N. S. Pedersen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5251)

Abstract

The neighbour-joining method reconstructs phylogenies by iteratively joining pairs of nodes until a single node remains. The criterion for which pair of nodes to merge is based on both the distance between the pair and the average distance to the rest of the nodes. In this paper, we present a new search strategy for the optimisation criteria used for selecting the next pair to merge and we show empirically that the new search strategy is superior to other state-of-the-art neighbour-joining implementations.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Martin Simonsen
    • 1
  • Thomas Mailund
    • 1
  • Christian N. S. Pedersen
    • 1
  1. 1.Bioinformatics Research Center (BIRC)University of AarhusÅrhus CDenmark

Personalised recommendations