Rapid Neighbour-Joining

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


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.


Memory Consumption Redundant Data Input Size Mutual Distance Wall Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Elias, I., Lagergren, J.: Fast neighbour joining. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1263–1274. Springer, Heidelberg (2005)Google Scholar
  2. 2.
    Elias, I., Lagergren, J.: Fast computation of distance estimators. BMC Bioinformatics 8, 89 (2007)CrossRefGoogle Scholar
  3. 3.
    Evans, J., Sheneman, L., Foster, J.A.: Relaxed neighbor joining: A fast distance-based phylogenetic tree construction method. Journal of Molecular Evolution 62(6), 785–792 (2006)CrossRefGoogle Scholar
  4. 4.
    Finn, R.D., Mistry, J., Schuster-Böckler, B., Griffiths-Jones, S., Hollich, V., Lassmann, T., Moxon, S., Marshall, M., Khanna, A., Durbin, R., Eddy, S.R., Sonnhammer, E.L.L., Bateman, A.: Pfam: Clans, web tools and services. Nucleic Acids Research, Database Issue 34, D247–D251 (2006)CrossRefGoogle Scholar
  5. 5.
    Howe, K., Bateman, A., Durbin, R.: QuickTree: Building huge neighbour-joining trees of protein sequences. Bioinformatics 18(11), 1546–1547 (2002)CrossRefGoogle Scholar
  6. 6.
    Mailund, T., Brodal, G.S., Fagerberg, R., Pedersen, C.N.S., Philips, D.: Recrafting the neighbor-joining method. BMC Bioinformatics 7(29) (2006)Google Scholar
  7. 7.
    Mailund, T., Pedersen, C.N.S.: QuickJoin – fast neighbour-joining tree reconstruction. Bioinformatics 20, 3261–3262 (2004)CrossRefGoogle Scholar
  8. 8.
    Saitou, N., Nei, M.: The neighbor-joining method: A new method for reconstructing phylogenetic trees. Molecular Biology and Evolution 4, 406–425 (1987)Google Scholar
  9. 9.
    Sanderson, M.L.: Inferring absolute rates of molecular evolution and divergence times in the absence of molecular clock. Bioinformatics 19, 301–302 (2003)CrossRefGoogle Scholar
  10. 10.
    Sheneman, L., Evans, J., Foster, J.A.: Clearcut: A fast implementation of relaxed neighbor-joining. Bioinformatics 22(22), 2823–2824 (2006)CrossRefGoogle Scholar
  11. 11.
    Studier, J.A., Kepler, K.J.: A note on the neighbour-joining method of Saitou and Nei. Molecular Biology and Evolution 5, 729–731 (1988)Google Scholar

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