An algorithm for computing virtual cut points in finite metric spaces

Dress, Andreas W. M., Huber, Katharina T., Koolen, Jacobus and Moulton, Vincent ORCID: https://orcid.org/0000-0001-9371-6435 (2007) An algorithm for computing virtual cut points in finite metric spaces. In: Combinatorial Optimization and Applications. Lecture Notes in Computing Science, 4616 . Springer Berlin / Heidelberg, pp. 4-10.

Full text not available from this repository. (Request a copy)

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.

Item Type:	Book Section
Faculty \ School:	Faculty of Science > School of Computing Sciences
UEA Research Groups:	Faculty of Science > Research Groups > Computational Biology Faculty of Science > Research Groups > Computational Biology > Phylogenetics (former - to 2018) Faculty of Science > Research Groups > Norwich Epidemiology Centre Faculty of Medicine and Health Sciences > Research Groups > Norwich Epidemiology Centre Faculty of Science > Research Groups > Computational Biology > Computational biology of RNA (former - to 2018)
Depositing User:	Vishal Gautam
Date Deposited:	05 Apr 2011 07:59
Last Modified:	30 Oct 2024 00:54
URI:	https://ueaeprints.uea.ac.uk/id/eprint/22268
DOI:	10.1007/978-3-540-73556-4_3

Actions (login required)

View Item