Abstract
Balanced minimum evolution is a distance-based criterion for the reconstruction of phylogenetic trees. Several algorithms exist to find the optimal tree with respect to this criterion. One approach is to minimize a certain linear functional over an appropriate polytope. Here we present polytopes that allow a similar linear programming approach to finding phylogenetic networks. We investigate a two-parameter family of polytopes that arise from phylogenetic networks, and which specialize to the Balanced Minimum Evolution polytopes as well as the Symmetric Travelling Salesman polytopes. We show that the vertices correspond to certain level-1 phylogenetic networks, and that there are facets or faces for every split. We also describe lower bound faces and a family of faces for every dimension.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aguiar M, Ardila F (2017) Hopf monoids and generalized permutahedra. arXiv:1709.07504 [math.CO], p 1–113
Brandes U, Cornelsen S (2009) Phylogenetic graph models beyond trees. Discrete Appl Math 157(10):2361–2369. https://doi.org/10.1016/j.dam.2008.06.031ISSN 0166-218X
Bryant D, Moulton V, Andreas S (2007) Consistency of the neighbor-net algorithm. Algorithms Mol Biol 2(1):8. https://doi.org/10.1186/1748-7188-2-8ISSN 1748-7188
Catanzaro D, Labbé M, Pesenti R, Salazar-González JJ (2012) The balanced minimum evolution problem. INFORMS J Comput 24(2):276–294. https://doi.org/10.1287/ijoc.1110.0455ISSN 1091-9856
Catanzaro D, Aringhieri R, Di Summa M, Pesenti R (2015) A branch-price-and-cut algorithm for the minimum evolution problem. Eur J Oper Res 244(3):753–765. https://doi.org/10.1016/j.ejor.2015.02.019ISSN 0377-2217
Devadoss S, Petti S (2017) A space of phylogenetic networks. SIAM J Appl Algebra Geom 1:683–705
Devadoss S, Durell C, Forcey S (2019) Split network polytopes and network spaces. In: SLC 82B, Proceedings of FPSAC 31, to appear
Eickmeyer K, Huggins P, Pachter L, Yoshida R (2008) On the optimality of the neighbor-joining algorithm. Algorithms Mol Biol 3(1):5
Ewgenij G, Michael J (2000) Polymake: a framework for analyzing convex polytopes. In: Kalai G, Ziegler GM (eds) Polytopes—Combinatorics and Computation. Birkhäuser, Basel, pp 43–74
Forcey S, Keefe L, Sands W (2016) Facets of the balanced minimal evolution polytope. J Math Biol 73(2):447–468
Forcey S, Keefe L, Sands W (2017) Split-facets for balanced minimal evolution polytopes and the permutoassociahedron. Bull Math Biol 79(5):975–994. https://doi.org/10.1007/s11538-017-0264-7
Forcey S, Hamerlinck G, Sands W (2018) Optimization problems in phylogenetics: polytopes, programming and interpretation. In: Robeva R, Macauley M (eds) Algebraic and Combinatorial Computational Biology. Academic Press, Cambridge
Gambette P, Huber KT, Scholz GE (2017a) Uprooted phylogenetic networks. Bull Math Biol 79(9):2022–2048. https://doi.org/10.1007/s11538-017-0318-xISSN 1522-9602
Haws D, Hodge T, Yoshida R (2011) Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope. Bull Math Biol 73(11):2627–2648. https://doi.org/10.1007/s11538-011-9640-x.ISSN 0092-8240
Levy D, Pachter L (2011) The neighbor-net algorithm. Adv Appl Math 47:240–258
Philippe G, Katharina H, Steven K (2017b) On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters. J Math Biol 74(7):1729–1751. https://doi.org/10.1007/s00285-016-1068-3
Semple C, Steel M (2004) Cyclic permutations and evolutionary trees. Adv. Appl. Math. 32(4):669–680. https://doi.org/10.1016/S0196-8858(03)00098-8.ISSN 0196-8858
Semple C, Steel M (2006) Unicyclic networks: compatibility and enumeration. IEEE/ACM Trans Comput Biol Bioinform 3(1):84–91. https://doi.org/10.1109/TCBB.2006.14ISSN 1545-5963
Sloane NJA (2018) The On-Line Encyclopedia of Integer Sequences. published electronically at www.oeis.org. Accessed 6 Feb 2020
Steel M (2016) Phylogeny—Discrete and Random Processes in Evolution. volume 89 of CBMS-NSF Regional Conference Series in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia. https://doi.org/10.1137/1.9781611974485.ch1ISBN 978-1-611974-47-8
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Durell, C., Forcey, S. Level-1 phylogenetic networks and their balanced minimum evolution polytopes. J. Math. Biol. 80, 1235–1263 (2020). https://doi.org/10.1007/s00285-019-01458-w
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00285-019-01458-w