Recrafting the neighbor-joining method release_slgmfrenmfhvzagebk736cwkrq

by Thomas Mailund, Gerth S Brodal, Rolf Fagerberg, Christian N S Pedersen, Derek Phillips

Published in BMC Bioinformatics.

2006   Volume 7, p29

Abstract

The neighbor-joining method by Saitou and Nei is a widely used method for constructing phylogenetic trees. The formulation of the method gives rise to a canonical Theta(n3) algorithm upon which all existing implementations are based. In this paper we present techniques for speeding up the canonical neighbor-joining method. Our algorithms construct the same phylogenetic trees as the canonical neighbor-joining method. The best-case running time of our algorithms are O(n2) but the worst-case remains O(n3). We empirically evaluate the performance of our algoritms on distance matrices obtained from the Pfam collection of alignments. The experiments indicate that the running time of our algorithms evolve as Theta(n2) on the examined instance collection. We also compare the running time with that of the QuickTree tool, a widely used efficient implementation of the canonical neighbor-joining method. The experiments show that our algorithms also yield a significant speed-up, already for medium sized instances.
In text/plain format

Archived Files and Locations

application/pdf  394.5 kB
file_latyyvcwhvgdnl5kxdcmramej4
www.brics.dk (web)
web.archive.org (webarchive)
application/pdf  539.0 kB
file_qtbam5lsfvhstgaevtgxy4rrqe
web.archive.org (webarchive)
bmcbioinformatics.biomedcentral.com (web)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2006-01-19
Language   en ?
Container Metadata
Open Access Publication
In DOAJ
In ISSN ROAD
In Keepers Registry
ISSN-L:  1471-2105
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: deb7e7da-0c7a-4d6b-a201-81a876ffdf41
API URL: JSON