Some variations on a theme by Buneman

DOI10.1007/BF02558485zbMath0927.05078OpenAlexW2072715813WikidataQ60962148 ScholiaQ60962148MaRDI QIDQ1293465

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

Publication date: 13 December 1999

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

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

zbMATH Keywords

Buneman complexphylogenetic treesphylogenetic networksmedian graphsplitsBuneman graph

Mathematics Subject Classification ID

Trees (05C05) Polytopes and polyhedra (52B99) Graph theory (05C99) Mathematical biology in general (92B99)

Related Items

Quasi-median graphs from sets of partitions, On the structure of the tight-span of a totally split-decomposable metric, Unnamed Item, Functorial hierarchical clustering with overlaps, Planar median graphs and cubesquare-graphs, The polytopal structure of the tight-span of a totally split-decomposable metric, Recovering trees from well-separated multi-state characters., Graphs of some CAT(0) complexes, Hyperconvexity and tight-span theory for diversities, An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex, \(\Delta\) additive and \(\Delta\) ultra-additive maps, Gromov's trees, and the Farris transform, Injective metrizability and the duality theory of cubings, A comparison between two distinct continuous models in projective cluster theory: The median and the tight-span construction, On the number of vertices and edges of the Buneman graph, Optimal realizations of two-dimensional, totally-decomposable metrics

Uses Software

• SplitsTree

Cites Work

• From copair hypergraphs to median graphs with latent vertices
• A canonical decomposition theory for metrics on a finite set
• On the number of vertices and edges of the Buneman graph
• \(T\)-theory: An overview
• Analyzing and visualizing sequence and distance data using SPLITSTREE