11 citations · 64 across the 22 of their papers we have counts for
23 papers
A Class of Unrooted Phylogenetic Networks Inspired by the Properties of Rooted Tree-Child Networks
Leo van Iersel, Mark Jones, Simone Linz +1
A directed phylogenetic network is tree-child if every non-leaf vertex has a child that is not a reticulation. As a class of directed phylogenetic networks, tree-child networks are…
Computational support for case-heavy proofs in mathematical phylogenetics
Luca Forte, Leo van Iersel, Steven Kelk +1
In this note we demonstrate that a number of case-heavy combinatorial proofs in the mathematical phylogenetics literature can be proven more compactly using computational support.…
Bounds on the sequence length sufficient to reconstruct binary level- phylogenetic networks under the CFN model
Martin Frohn, Niels Holtgrefe, Leo van Iersel +2
Phylogenetic trees and networks are graphs used to model evolutionary relationships, with trees representing strictly branching histories and networks allowing for events in which…
Metrics for classes of semi-binary phylogenetic networks using -representations
Christopher Reichling, Leo van Iersel, Yukihiro Murakami
Phylogenetic networks are useful in representing the evolutionary history of taxa. In certain scenarios, one requires a way to compare different networks. In practice, this can be…
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…
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…