A network N on a finite set X, |X|≥ 2, is a connected directed
acyclic g...
Median graphs are connected graphs in which for all three vertices there...
Evolutionary histories for species that cross with one another or exchan...
Recently there has been considerable interest in the problem of finding ...
Given a distance D on a finite set X with n elements, it is interesting
...
The problem of realizing finite metric spaces in terms of weighted graph...
This paper studies the relationship between undirected (unrooted) and
di...
A multilabeled tree (or MUL-tree) is a rooted tree in which every leaf i...
Phylogenetic networks are a type of leaf-labelled, acyclic, directed gra...
An important problem in phylogenetics is the construction of phylogeneti...