Herrmann, Sven; Huber, Katharina; Moulton, Vincent; … - In: Journal of Classification 29 (2012) 3, pp. 321-340
A k-dissimilarity D on a finite set X, |X| ≥ k, is a map from the set of size k subsets of X to the real numbers. Such maps naturally arise from edgeweighted trees T with leaf-set X: Given a subset Y of X of size k, D(Y ) is defined to be the total length of the smallest subtree of T with...