Obtaining splits from cut sets of tight spans
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.
- The Buneman index via polyhedral split decomposition
- On the structure of the tight-span of a totally split-decomposable metric
- An algorithm for computing cutpoints in finite metric spaces
- The polytopal structure of the tight-span of a totally split-decomposable metric
- Characterizing cell-decomposable metrics
- \(T\)-theory: An overview
- A canonical decomposition theory for metrics on a finite set
- Barriers in metric spaces
- Compatible decompositions and block realizations of finite metrics
- Cut points in metric spaces
- Generosity Helps or an 11-Competitive Algorithm for Three Servers
- scientific article; zbMATH DE number 1047152 (Why is no real title available?)
- Six theorems about injective metric spaces
- The probabilities of rooted tree-shapes generated by random bifurcation
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- Understanding and using linear programming
- Functorial hierarchical clustering with overlaps
- The polytopal structure of the tight-span of a totally split-decomposable metric
- Split closure and intersection cuts
- Order distances and split systems
- Injective metrizability and the duality theory of cubings
- An algorithm for computing cutpoints in finite metric spaces
- Phylogenetic analysis, split systems and Boolean functions
- scientific article; zbMATH DE number 1500572 (Why is no real title available?)
- scientific article; zbMATH DE number 2086918 (Why is no real title available?)
- The Buneman index via polyhedral split decomposition
- On the structure of the tight-span of a totally split-decomposable metric
This page was built for publication: Obtaining splits from cut sets of tight spans
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446320)
