Annals of Combinatorics

, Volume 1, Issue 1, pp 339–352 | Cite as

Some variations on a theme by Buneman

  • A. Dress
  • K. Huber
  • V. Moulton


In 1971, Peter Buneman presented a paper in which he described, amongst other things, a way to construct a tree from a collection of pairwise compatible splits of a finite set. This construction is immediately generalizable to a collection of arbitrary splits, in which case it gives rise to theBuneman graph, a certain connected, median graph representing the given collection of splits in a canonical fashion. In this paper, we look at the complex obtained by filling those faces of the associated hypercube whose vertices consist only of vertices in the Buneman graph, a complex that we call theBuneman complex. In particular, we give a natural filtration of the Buneman complex, and show that this filtration collapses when the system of splitis is weakly compatible. In the case where the family of splits is not weakly compatible, we also see that the filtration naturally gives us a way to associate a graded hierarchy of phylogenetic networks to the collection of splits.

AMS Subject Classification

04A03 04A20 05C99 52B99 92B99 


phylogenetic networks phylogenetic trees median networks hypercubes hierarchical clustering split systems split decomposition Buneman graphs compatibility of Taxonomic characters 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    H.-J. Bandelt, Phylogenetic networks, Verh. naturwiss. Ver. Hamburg34 (1991) 51–57.Google Scholar
  2. 2.
    H.-J. Bandelt and A. Dress, A canonical decomposition theory for metrics on a finite set, Adv. Math.92 (1992) 47–105.CrossRefMathSciNetGoogle Scholar
  3. 3.
    H.-J. Bandelt and A. Dress, A new and useful approach to phylogenetic analysis of distance data, Molecular Phylogenetics and Evolution1, (1992) 242–252.CrossRefGoogle Scholar
  4. 4.
    H.-J. Bandelt and A. Dress, A relational approach to split decomposition, In: Information and Classification, O. Opitz et al., Eds., Springer-Verlag, 1993, pp. 123–131.Google Scholar
  5. 5.
    P. Buneman, The recovery of trees from measures of dissimilarity, In: Mathematics in the Archeological and Historical Sciences, F. Hodson et al., Eds. Ediburgh University Press, 1971, pp. 387–395.Google Scholar
  6. 6.
    J. Barthelemy, From copair hypergraphs to median graphs with latent vertices. Discrete Math.76 (1989) 9–28.CrossRefMathSciNetGoogle Scholar
  7. 7.
    J. Barthelemy and A. Guenoche, Trees and Proximity Representations, John Wiley, 1991.Google Scholar
  8. 8.
    A. Dress, M. Hendy, K. Huber, and V. Moulton, On the number of vertices and edges of the Buneman graph, Ann. Combin.1 (1997) 329–337.MathSciNetGoogle Scholar
  9. 9.
    A. Dress, K. Huber, and V. Moulton, A new characterization of weak compatibility using the T-construction, in preparation.Google Scholar
  10. 10.
    A. Dress, D. Huson, and V. Moulton, Analyzing and visualizing distance data with the splitstree graph, Discrete Appl. Math.71 (1996) 95–110.CrossRefMathSciNetGoogle Scholar
  11. 11.
    A. Dress, V. Moulton, and W. Terhalle, T-theory: an overview, Europ. J. Combin.17 (1996) 161–175.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • A. Dress
    • 1
  • K. Huber
    • 1
  • V. Moulton
    • 1
  1. 1.FSPM-StrukturbildugsprozesseUniversity of BielefeldBielefeldGermany

Personalised recommendations