title: 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 [equation; see text] 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 l2 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.
authors.affiliation: Department of Mathematics, University of California at Berkeley Berkeley, CA 94720-3840, USA. eickmeye@informatik.hu-berlin.de
authors.forename: Kord
authors.initials: K
authors.lastname: Eickmeyer
authors.forename: Peter
authors.initials: P
authors.lastname: Huggins
authors.forename: Lior
authors.initials: L
authors.lastname: Pachter
authors.forename: Ruriko
authors.initials: R
authors.lastname: Yoshida