activity
20052026
most citedPhylogenetic Networks Do not Need to Be Complex: Using Fewer Reticulations to Represent Conflicting Clusters

11 citations · 38 across the 16 of their papers we have counts for

collaborators
Showing math.COShow all

5 papers · 1 filter

math.CO2026

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…

math.CO2021

Level- networks from shortest and longest distances

Katharina T. Huber, Leo van Iersel, Remie Janssen +3

Recently it was shown that a certain class of phylogenetic networks, called level- networks, cannot be reconstructed from their associated distance matrices. In this paper, we s…

math.CO2020

A Unifying Characterization of Tree-based Networks and Orchard Networks using Cherry Covers

Leo van Iersel, Remie Janssen, Mark Jones +2

Phylogenetic networks are used to study evolutionary relationships between species in biology. Such networks are often categorized into classes by their topological features, which…

math.CO2012

Approximation algorithms for nonbinary agreement forests

Leo van Iersel, Steven Kelk, Nela Lekić +1

Given two rooted phylogenetic trees on the same set of taxa X, the Maximum Agreement Forest problem (MAF) asks to find a forest that is, in a certain sense, common to both trees an…

math.CO2006

Prefix reversals on binary and ternary strings

Cor Hurkens, Leo van Iersel, Judith Keijsper +3

Given a permutation pi, the application of prefix reversal f^(i) to pi reverses the order of the first i elements of pi. The problem of Sorting By Prefix Reversals (also known as p…