Skip to main content

An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces

  • Conference paper
Combinatorial Optimization and Applications (COCOA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4616))

Abstract

In this note, we consider algorithms for computing virtual cut points in finite metric spaces and explain how these points can be used to study compatible decompositions of metrics generalizing the well-known decomposition of a tree metric into a sum of pairwise compatible split metrics.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bandelt, H.-J., Dress, A.W.M.: Split decomposition: A new and useful approach to phylogenetic analysis of distance data. Mol. Phyl. Evol. 1, 242–252 (1992)

    Article  Google Scholar 

  2. Bandelt, H.-J., Dress, A.W.M.: A canonical split decomposition theory for metrics on a finite set. Adv. Math. 92, 47–105 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  3. Buneman, P.: The recovery of trees from measures of dissimilarity. In: Hodson, F.R., Kendall, D.G., Tautu, P. (eds.) Mathematics in the Archaeological and Historical Sciences, pp. 387–395. Edinburgh University Press, Edinburgh (1971)

    Google Scholar 

  4. Dress, A.W.M.: Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups. Adv. Math. 53, 321–402 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dress, A.W.M., Huber, K.T., Moulton, V.: An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex. Adv. Math. 168, 1–28 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  6. Dress, A.W.M., Huber, K.T., Koolen, J., Moulton, V.: Compatible Decompositions and Block Realizations of Finite Metrics (submitted)

    Google Scholar 

  7. Dress, A.W.M., Moulton, V., Terhalle, W.: T-Theory. Europ. J. of Combin. 17, 161–175 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  8. Dress, A.W.M., Moulton, V., Steel, M.: Trees, taxonomy and strongly compatible multi-state characters. Adv. App. Math. 19, 1–30 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  9. Dress, A.W.M., Scharlau, R.: Gated sets in metric spaces. Aeq. Math. 34, 112–120 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  10. Isbell, J.: Six theorems about metric spaces. Comment. Math. Helv. 39, 65–74 (1964)

    Article  MATH  MathSciNet  Google Scholar 

  11. Koolen, J., Moulton, V., Toenges, U.: A classification of the six-point prime metrics. Europ. J. of Combin. 21, 815–829 (2000)

    Article  MATH  Google Scholar 

  12. Semple, C., Steel, M.A.: Phylogenetics. Oxford University Press, Oxford (2003)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Andreas Dress Yinfeng Xu Binhai Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dress, A.W.M., Huber, K.T., Koolen, J., Moulton, V. (2007). An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces. In: Dress, A., Xu, Y., Zhu, B. (eds) Combinatorial Optimization and Applications. COCOA 2007. Lecture Notes in Computer Science, vol 4616. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73556-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73556-4_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73555-7

  • Online ISBN: 978-3-540-73556-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics