Obtaining splits from cut sets of tight spans (Q2446320): Difference between revisions

To any metric \(D\) on a finite set \(X\), there is associated a metric space \(T (D)\) which is known as its tight span. Properties of \(T (D)\) often reveal properties of \(D\) and provide information on the relationship between the elements of \(X.\) For example, cut sets of \(T (D),\) that is, subsets of \(T (D)\) whose removal disconnect \(T (D),\) can identify clusters suggested by \(D\) and indicate how \(T (D)\) (and hence \(D\)) may be decomposed into components. Given a bipartition or split \(S\) of \(X,\) the authors introduce a real-valued index \(\varepsilon_{(D,S)}\) (the definition of which depends on \(T(D))\) and argue that splits \(S\) for which \(\varepsilon_{(D,S)}\) is small are of interest for phylogenetic network construction from distances. The main result establishes that their index is closely related to another, more easily computable index \(\delta_{(D,S)}\) whose definition depends only on \(D\). Using a biological data set and simulated distance matrices, they illustrate how these two new indices extend and complement current distance-based methods for phylogenetic network construction.