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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Bandelt, H.-J., Dress, A.W.M.: A canonical split decomposition theory for metrics on a finite set. Adv. Math. 92, 47–105 (1992)
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)
Dress, A.W.M.: Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups. Adv. Math. 53, 321–402 (1984)
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)
Dress, A.W.M., Huber, K.T., Koolen, J., Moulton, V.: Compatible Decompositions and Block Realizations of Finite Metrics (submitted)
Dress, A.W.M., Moulton, V., Terhalle, W.: T-Theory. Europ. J. of Combin. 17, 161–175 (1996)
Dress, A.W.M., Moulton, V., Steel, M.: Trees, taxonomy and strongly compatible multi-state characters. Adv. App. Math. 19, 1–30 (1997)
Dress, A.W.M., Scharlau, R.: Gated sets in metric spaces. Aeq. Math. 34, 112–120 (1987)
Isbell, J.: Six theorems about metric spaces. Comment. Math. Helv. 39, 65–74 (1964)
Koolen, J., Moulton, V., Toenges, U.: A classification of the six-point prime metrics. Europ. J. of Combin. 21, 815–829 (2000)
Semple, C., Steel, M.A.: Phylogenetics. Oxford University Press, Oxford (2003)
Author information
Authors and Affiliations
Editor information
Rights 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)