Abstract
Balanced minimum evolution (BME) is a statistically consistent distance-based method to reconstruct a phylogenetic tree from an alignment of molecular data. In 2000, Pauplin showed that the BME method is equivalent to optimizing a linear functional over the BME polytope, the convex hull of the BME vectors obtained from Pauplin’s formula applied to all binary trees. The BME method is related to the Neighbor Joining (NJ) Algorithm, now known to be a greedy optimization of the BME principle. Further, the NJ and BME algorithms have been studied previously to understand when the NJ Algorithm returns a BME tree for small numbers of taxa. In this paper we aim to elucidate the structure of the BME polytope and strengthen knowledge of the connection between the BME method and NJ Algorithm. We first prove that any subtree-prune-regraft move from a binary tree to another binary tree corresponds to an edge of the BME polytope. Moreover, we describe an entire family of faces parameterized by disjoint clades. We show that these clade-faces are smaller dimensional BME polytopes themselves. Finally, we show that for any order of joining nodes to form a tree, there exists an associated distance matrix (i.e., dissimilarity map) for which the NJ Algorithm returns the BME tree. More strongly, we show that the BME cone and every NJ cone associated to a tree T have an intersection of positive measure.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
(2010). Tree of Life web project. URL http://tolweb.org/tree/.
Bandelt, H., & Dress, A. W. (1992). A canonical decomposition theory for metrics on a finite set. Adv. Math., 92, 47–105.
Bonet, M. L., & St. John, K. (2009). Efficiently calculating evolutionary tree measures using sat. In: Twelfth international conference on theory and applications of satisfiability testing (SAT 09).
Bordewich, M., Gascuel, O., Huber, K., & Moulton, V. (2009). Consistency of topological moves based on the balanced minimum evolution principle of phylogenetic inference. IEEE/ACM Trans. Comput. Biol. Bioinform., 6, 110–117.
Bryant, D. (2005). On the uniqueness of the selection criterion in neighbor-joining. J. Classif., 22, 3–15.
Buneman, P. (1971). The recovery of trees from measures of similarity. In: F. Hodson, D. Kendall, & P. Tautu (Eds.), Mathematics of the archaeological and historical sciences (pp. 387–395). Edinburgh: Edinburgh University Press.
Ciccarelli, F. D., Doerks, T., von Mering, C., Creevey, C. J., Snel, B., & Bork, P. (2006). Toward automatic reconstruction of a highly resolved tree of life. Science, 311, 1283–1287.
Cueto, M. A., & Matsen, F. A. (2010). Polyhedral geometry of phylogenetic rogue taxa. Preprint arXiv:1001.5241.
Day, W. (1987). Computational complexity of inferring phylogenies from dissimilarity matrices. Bull. Math. Biol., 49, 461–467.
DeBry, R. W. (1992). The consistency of several phylogeny-inference methods under varying evolutionary rates. Mol. Biol. Evol., 9, 537–551.
Denis, F., & Gascuel, O. (2003). On the consistency of the minimum evolution principle of phylogenetic inference. Discrete Appl. Math., 127, 63–77.
Desper, R., & Gascuel, O. (2002). Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle. J. Comput. Biol., 9(5), 687–705.
Desper, R., & Gascuel, O. (2004). Theoretical foundation of the balanced minimum evolution method of phylogenetic inference and its relationship to weighted least-squares tree fitting. Mol. Biol. Evol., 21, 587–598.
Eickmeyer, K., Huggins, P., Pachter, L., & Yoshida, R. (2008). On the optimality of the neighbor-joining algorithm. Algorithms Mol. Biol., 3(5). URL http://www.almob.org/content/3/1/5
Eickmeyer, K., & Yoshida, R. (2008). Lecture notes in computer science: Vol. 5147. The geometry of the neighbor-joining algorithm for small trees (pp. 81–95).
Felsenstein, J. (1978). Cases in which parsimony and compatibility methods will be positively misleading. Syst. Zool., 27, 401–410.
Felsenstein, J. (2003). Inferring phylogenies. Sinauer Associates, Inc.
Gascuel, O., & Steel, M. (2006). Neighbor-joining revealed. Mol. Biol. Evol., 23, 1997–2000.
Pauplin, Y. (2000). Direct calculation of a tree length using a distance matrix. J. Mol. Evol., 51, 41–47.
Roch, S. (2004). A short proof that phylogenetic tree reconstruction by maximum likelihood is hard. IEEE/ACM Trans. Comput. Biol. Bioinform., 3, 92–94.
Saitou, N., & Nei, M. (1987). The neighbor joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol., 4, 406–425.
Schrijver, A. (1986). Theory of linear and integer programming. New York: John Wiley & Sons, Inc.
Semple, C., & Steel, M. (2003). Oxford lecture series in mathematics and its applications: Vol. 24. Phylogenetics. Oxford: Oxford University Press. ISBN 0-19-850942-1.
Steel, M., & Penny, D. (1993). Distributions of tree comparison metrics-some new results. Syst. Biol., 42, 126–141.
Steel, M., & Semple, C. (2004). Cyclic permutations and evolutionary trees. Adv. Appl. Math., 32, 669–680.
Studier, J. A., & Keppler, K. J. (1988). A note on the neighbor-joining method of Saitou and Nei. Mol. Biol. Evol., 5, 729–731.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Haws, D.C., Hodge, T.L. & Yoshida, R. Optimality of the Neighbor Joining Algorithm and Faces of the Balanced Minimum Evolution Polytope. Bull Math Biol 73, 2627–2648 (2011). https://doi.org/10.1007/s11538-011-9640-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11538-011-9640-x