10 citations · 11 across the 9 of their papers we have counts for
5 papers · 1 filter
A Wild Sheep Chase Through an Orchard
Jordan Dempsey, Leo van Iersel, Mark Jones +2
Orchards are a biologically relevant class of phylogenetic networks as they can describe treelike evolutionary histories augmented with horizontal transfer events. Moreover, the cl…
A Simple 4-Approximation Algorithm for Maximum Agreement Forests on Multiple Unrooted Binary Trees
Jordan Dempsey, Leo van Iersel, Mark Jones +1
We present a simple 4-approximation algorithm for computing a maximum agreement forest of multiple unrooted binary trees. This algorithm applies LP rounding to an extension of a re…
Reconstructing semi-directed level-1 networks using few quarnets
Martin Frohn, Niels Holtgrefe, Leo van Iersel +2
Semi-directed networks are partially directed graphs that model evolution where the directed edges represent reticulate evolutionary events. We present an algorithm that reconstruc…
When are quarnets sufficient to reconstruct semi-directed phylogenetic networks?
Katharina T. Huber, Leo van Iersel, Mark Jones +2
Phylogenetic networks are graphs that are used to represent evolutionary relationships between different taxa. They generalize phylogenetic trees since for example, unlike trees, t…
Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
Niels Holtgrefe, Leo van Iersel, Mark Jones
To measure the tree-likeness of a directed acyclic graph (DAG), a new width parameter that considers the directions of the arcs was recently introduced: scanwidth. We present the f…