Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published April 30, 2008 | Supplemental Material + Submitted + Published
Journal Article Open

On the optimality of the neighbor-joining algorithm

Abstract

The popular neighbor-joining (NJ) algorithm used in phylogenetics is a greedy algorithm for finding the balanced minimum evolution (BME) tree associated to a dissimilarity map. From this point of view, NJ is "optimal" when the algorithm outputs the tree which minimizes the balanced minimum evolution criterion. We use the fact that the NJ tree topology and the BME tree topology are determined by polyhedral subdivisions of the spaces of dissimilarity maps ℛ^(^n _2)_+ to study the optimality of the neighbor-joining algorithm. In particular, we investigate and compare the polyhedral subdivisions for n ≤ 8. This requires the measurement of volumes of spherical polytopes in high dimension, which we obtain using a combination of Monte Carlo methods and polyhedral algorithms. Our results include a demonstration that highly unrelated trees can be co-optimal in BME reconstruction, and that NJ regions are not convex. We obtain the l_2 radius for neighbor-joining for n = 5 and we conjecture that the ability of the neighbor-joining algorithm to recover the BME tree depends on the diameter of the BME tree.

Additional Information

© Eickmeyer et al; licensee BioMed Central Ltd. 2008. This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Received: 13 November 2007. Accepted: 30 April 2008. Published: 30 April 2008. The authors declare that they have no competing interests.

Attached Files

Published - art_3A10.1186_2F1748-7188-3-5.pdf

Submitted - 0710.5142.pdf

Supplemental Material - 13015_2007_46_MOESM1_ESM.pdf

Supplemental Material - 13015_2007_46_MOESM2_ESM.pdf

Supplemental Material - 13015_2007_46_MOESM3_ESM.pdf

Supplemental Material - 13015_2007_46_MOESM4_ESM.pdf

Files

13015_2007_46_MOESM2_ESM.pdf
Files (559.2 kB)
Name Size Download all
md5:478de4aaf36d3eb5a33693362c0ab06b
8.9 kB Preview Download
md5:61a6544b38e3963f76ff6bfa8e9e9c4d
13.2 kB Preview Download
md5:c7fec55bab046839e4faf0aa08b99a9a
8.0 kB Preview Download
md5:3422cc5255ea91be3b6b735b47500e13
5.4 kB Preview Download
md5:52010f5ad8345363d7b829227bc6942e
227.8 kB Preview Download
md5:e02e5dff5b5bacc0cd7f6f69f5762e5c
295.9 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 24, 2023