A comparison between two distinct continuous models in projective cluster theory: The median and the tight-span construction

DOI10.1007/BF01608527zbMath0928.91045OpenAlexW1985643504MaRDI QIDQ1293419

Vincent L. Moulton, Andreas W. M. Dress, Katharina T. Huber

Publication date: 20 December 1999

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01608527

zbMATH Keywords

hypercubephylogenetic treesphylogenetic networkssplit decompositionweak compatibilitysplit systemsT-theoryBuneman graphmedian networkspairwise compatibilityT-construction

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Applications of graph theory (05C90) Polytopes and polyhedra (52B99)

Related Items

Quasi-median graphs from sets of partitions ⋮ On the structure of the tight-span of a totally split-decomposable metric ⋮ Block realizations of finite metrics and the tight-span construction. I: The embedding theorem ⋮ Unnamed Item ⋮ Functorial hierarchical clustering with overlaps ⋮ The polytopal structure of the tight-span of a totally split-decomposable metric ⋮ An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex ⋮ Injective metrizability and the duality theory of cubings ⋮ Optimal realizations of two-dimensional, totally-decomposable metrics

Uses Software

• SplitsTree

Cites Work

• From copair hypergraphs to median graphs with latent vertices
• Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
• A canonical decomposition theory for metrics on a finite set
• On the number of vertices and edges of the Buneman graph
• Some variations on a theme by Buneman
• \(T\)-theory: An overview
• Analyzing and visualizing sequence and distance data using SPLITSTREE
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item