Rapid neighbour-joining

Martin Simonsen*, Thomas Mailund, Christian N.S. Pedersen

*Corresponding author for this work

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

112 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationAlgorithms in Bioinformatics - 8th International Workshop, WABI 2008, Proceedings
Number of pages10
Publication date28 Nov 2008
Pages113-122
ISBN (Print)3540873600, 9783540873600
DOIs
Publication statusPublished - 28 Nov 2008
Event8th International Workshop on Algorithms in Bioinformatics, WABI 2008 - Karlsruhe, Germany
Duration: 15 Sept 200819 Sept 2008

Conference

Conference8th International Workshop on Algorithms in Bioinformatics, WABI 2008
Country/TerritoryGermany
CityKarlsruhe
Period15/09/200819/09/2008
SeriesLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5251 LNBI
ISSN0302-9743

Fingerprint

Dive into the research topics of 'Rapid neighbour-joining'. Together they form a unique fingerprint.

Cite this