31 citations · 96 across the 55 of their papers we have counts for
5 papers · 1 filter
Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets
K. T. Huber, V. Moulton
Phylogenetic networks are a generalization of phylogenetic trees that are used in biology to represent reticulate or non-treelike evolution. Recently, several algorithms have been…
Optimal realisations of two-dimensional, totally-decomposable metrics
Sven Herrmann, Jack Koolen, Alice Lesser +2
A realisation of a metric on a finite set is a weighted graph whose vertex set contains such that the shortest-path distance between elements of considered…
The 'Butterfly effect' in Cayley graphs, and its relevance for evolutionary genomics
Vincent Moulton, Mike Steel
Suppose a finite set is repeatedly transformed by a sequence of permutations of a certain type acting on an initial element to produce a final state . We investigate how…
Trees, Tight-Spans and Point Configuration
Sven Herrmann, Vincent Moulton
Tight-spans of metrics were first introduced by Isbell in 1964 and rediscovered and studied by others, most notably by Dress, who gave them this name. Subsequently, it was found th…
Blocks and Cut Vertices of the Buneman Graph
A. W. W. Dress, K. T. Huber, J. Koolen +1
Given a set $\Sg$ of bipartitions of some finite set of cardinality at least 2, one can associate to $\Sg$ a canonical -labeled graph $\B(\Sg)$, called the Buneman graph. Th…