31 citations · 96 across the 55 of their papers we have counts for
28 papers · 1 filter
Shared ancestry graphs and symbolic arboreal maps
Katharina T. Huber, Vincent Moulton, Guillaume E. Scholz
A network on a finite set , , is a connected directed acyclic graph with leaf set in which every root in has outdegree at least 2 and no vertex in has…
Cherry picking in forests: A new characterization for the unrooted hybrid number of two phylogenetic trees
Katharina T. Huber, Simone Linz, Vincent Moulton
Phylogenetic networks are a special type of graph which generalize phylogenetic trees and that are used to model non-treelike evolutionary processes such as recombination and hybri…
Injective split systems
M. Hellmuth, K. T. Huber, V. Moulton +2
A split system on a finite set , , is a set of bipartitions or splits of which contains all splits of the form , . To any such…
Polynomial invariants for cactuses
Leo van Iersel, Vincent Moulton, Yukihiro Murakami
Graph invariants are a useful tool in graph theory. Not only do they encode useful information about the graphs to which they are associated, but complete invariants can be used to…
Compatible split systems on a multiset
Vincent Moulton, Guillaume E. Scholz
A split system on a multiset is a set of bipartitions of . Such a split system is compatible if it can be represented by a tree in such a way…
Forest-based networks
Katharina T. Huber, Vincent Moulton, Guillaume E. Scholz
In evolutionary studies it is common to use phylogenetic trees to represent the evolutionary history of a set of species. However, in case the transfer of genes or other genetic in…