Galois connections for phylogenetic networks and their polytopes

  title={Galois connections for phylogenetic networks and their polytopes},
  author={Stefan Forcey and Drew Scalzo},
  journal={arXiv: Combinatorics},
We describe Galois connections which arise between two kinds of combinatorial structures, both of which generalize trees with labelled leaves, and then apply those connections to a family of polytopes. The graphs we study can be imbued with metric properties or associated to vectors. Famous examples are the Billera-Holmes-Vogtmann metric space of phylogenetic trees, and the Balanced Minimal Evolution polytopes of phylogenetic trees described by Eickmeyer, Huggins, Pachter and Yoshida. Recently… Expand

Figures from this paper

Circular planar electrical networks, Split systems, and Phylogenetic networks
We study a new invariant of circular planar electrical networks, well known to phylogeneticists: the circular split system. We use our invariant to answer some open questions about levels ofExpand
Phylogenetic Networks as Circuits With Resistance Distance
It is suggested that it can be useful to view unknown genetic distance along edges in phylogenetic networks as analogous to unknown resistance in electric circuits, which turns out to have nice mathematical properties which allow the precise reconstruction of networks. Expand


Uprooted Phylogenetic Networks
It is shown that not only can a so-called (uprooted) 1-nested network N be obtained from the Buneman graph associated with the split system $$Sigma (N)$$Σ(N) induced on the set of leaves of N but also that that graph is, in a well-defined sense, optimal. Expand
Counting phylogenetic networks of level 1 and 2.
This paper provides enumeration formulas (exact and asymptotic) for rooted and unrooted level-1 and level-2 phylogenetic networks with a given number of leaves and proves that the distribution of some parameters of these networks are asymPTotically normally distributed. Expand
Level-1 phylogenetic networks and their balanced minimum evolution polytopes
This work investigates a two-parameter family of polytopes that arise from phylogenetic networks, and which specialize to the Balanced Minimum Evolution poly topes as well as the Symmetric Travelling Salesmanpolytopes, and describes lower bound faces and a family of faces for every dimension. Expand
Basic Phylogenetic Combinatorics
This book focuses on the interrelationship between the principal options for encoding phylogenetic trees: split systems, quartet systems and metrics, and highlights how each provides a unique perspective for viewing and perceiving the combinatorial structure of a phylogenetic tree. Expand
Phylogeny - discrete and random processes in evolution
  • M. Steel
  • Computer Science
  • CBMS-NSF regional conference series in applied mathematics
  • 2016
This self-contained book addresses the underlying mathematical theory behind the reconstruction and analysis of phylogenies, grounded in classical concepts from discrete mathematics and probability theory as well as techniques from other branches of mathematics (algebra, topology, differential equations). Expand
A Space of Phylogenetic Networks
A circular split network is considered, a generalization of a tree in which multiple parallel edges signify divergence, and a geometric space of such networks is introduced, forming a natural extension of the work by Billera, Holmes, and Vogtmann on tree space. Expand
Geometry of the Space of Phylogenetic Trees
We consider a continuous space which models the set of all phylogenetic trees having a fixed set of leaves. This space has a natural metric of nonpositive curvature, giving a way of measuringExpand
Affine and Projective Tree Metric Theorems
The tree metric theorem provides a combinatorial four-point condition that characterizes dissimilarity maps derived from pairwise compatible split systems. A related weaker four point conditionExpand
Split-Facets for Balanced Minimal Evolution Polytopes and the Permutoassociahedron
It is shown that BME polytope has a sublattice of its poset of faces which is isomorphic to a quotient of the well-studied permutoassociahedron, which corresponds to compatible sets of splits displayed by phylogenetic trees and extends the lattice of faces of the BMEpolytope found by Hodge, Haws and Yoshida. Expand
A Primer on Galois Connections
The rudiments of the theory of Galois connections (or residuation theory, as it is sometimes called) are provided, together with many examples and applications, that can be used as an effective research tool throughout mathematics and related areas. Expand