28 citations · 80 across the 12 of their papers we have counts for
3 papers · 1 filter
Recognizing Treelike k-Dissimilarities
Sven Herrmann, Katharina T. Huber, Vincent Moulton +1
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 edge-weighted trees T with leaf-se…
Computing the blocks of a quasi-median graph
Sven Herrmann, Vincent Moulton
Quasi-median graphs are a tool commonly used by evolutionary biologists to visualise the evolution of molecular sequences. As with any graph, a quasi-median graph can contain cut v…
Searching for Realizations of Finite Metric Spaces in Tight Spans
Sven Herrmann, Vincent Moulton, Andreas Spillner
An important problem that commonly arises in areas such as internet traffic-flow analysis, phylogenetics and electrical circuit design, is to find a representation of any given met…