Facets of the balanced minimal evolution polytope
From MaRDI portal
Publication:304049
DOI10.1007/S00285-015-0957-1zbMATH Open1346.90572arXiv1501.05536OpenAlexW1586629546WikidataQ50747281 ScholiaQ50747281MaRDI QIDQ304049FDOQ304049
Authors: Stefan Forcey, Logan Keefe, William Sands 
Publication date: 23 August 2016
Published in: Journal of Mathematical Biology (Search for Journal in Brave)
Abstract: A phylogenetic tree is a way to organize a finite set of species, individuals or other sources of related data. The species for which we have existing DNA data make up the set of leaves of the tree. The balanced minimal evolution method of creating phylogenetic trees can be formulated as a linear programming problem, minimizing an inner product over the vertices of the BME polytope. In this paper we undertake the first steps of describing the facets of this polytope.
Full work available at URL: https://arxiv.org/abs/1501.05536
Recommendations
- On the balanced minimum evolution polytope
- Split-facets for balanced minimal evolution polytopes and the permutoassociahedron
- Enumerating vertices of the balanced minimum evolution polytope
- Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope
- The balanced minimum evolution problem
- Minimal equivelar polytopes
- On a facet of the balanced subgraph polytope
- A tutorial on the balanced minimum evolution problem
- Approximating the balanced minimum evolution problem
Cites Work
- polymake: a framework for analyzing convex polytopes
- Computational complexity of inferring phylogenies from dissimilarity matrices
- Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope
- Title not available (Why is that?)
- All 0-1 polytopes are traveling salesman polytopes
- The balanced minimum evolution problem
- Approximating the balanced minimum evolution problem
Cited In (13)
- Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope
- A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem
- On the balanced minimum evolution polytope
- Galois connections for phylogenetic networks and their polytopes
- On the approximability of the fixed-tree balanced minimum evolution problem
- Level-1 phylogenetic networks and their balanced minimum evolution polytopes
- An information theory perspective on the balanced minimum evolution problem
- Enumerating vertices of the balanced minimum evolution polytope
- Polyhedral geometry of phylogenetic rogue taxa
- Split-facets for balanced minimal evolution polytopes and the permutoassociahedron
- A tutorial on the balanced minimum evolution problem
- Split network polytopes and network spaces
- Polyhedral combinatorics of UPGMA cones
Uses Software
This page was built for publication: Facets of the balanced minimal evolution polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q304049)
