Abstract
In phylogenetics and other areas of classification, the Buneman graph is commonly used to represent a collection of bipartitions or splits of a (finite) set 𝓧 in order to display evolutionary relationships. The set 𝓧 usually corresponds to a set of taxa (or species), and the splits are usually derived from molecular sequence data associated to the taxa. One issue with this approach is that missing molecular data can lead to bipartitions of subsets of 𝓧 or partial splits, instead of splits of the full set 𝓧. In this paper, we show that the definition of the Buneman graph can be naturally extended to collections of partial splits of a set 𝓧. Just as with splits, we show that the graph so obtained is an 𝓧-labeled median graph but, in contrast to the usual Buneman graph, the elements in X are represented by convex subsets of the vertex set of the graph instead of single vertices. We also show that the Buneman graph for a collection of partial splits is closely related to subtree distances. In particular, for a collection 𝒮 of weighted partial splits that satisfies a certain pairwise compatibility condition, we show that the corresponding edge-weighted Buneman graph is the unique minimal tree that represents the subtree distance 𝓭 corresponding to 𝒮. Moreover, we show that in this special situation the Buneman graph can also be considered as a type of configuration space for the set of all tree-metrics that minimally extend the subtree distance 𝓭.