activity
20182021
collaborators

5 papers

math.CO2021

Orchard Networks are Trees with Additional Horizontal Arcs

Leo van Iersel, Remie Janssen, Mark Jones +1

Phylogenetic networks are used in biology to represent evolutionary histories. The class of orchard phylogenetic networks was recently introduced for their computational benefits,…

cs.DM2019

A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees

Leo van Iersel, Remie Janssen, Mark Jones +2

We present the first fixed-parameter algorithm for constructing a tree-child phylogenetic network that displays an arbitrary number of binary input trees and has the minimum number…

math.CO2018

Reconstructing Tree-Child Networks from Reticulate-Edge-Deleted Subnetworks

Yukihiro Murakami, Leo van Iersel, Remie Janssen +2

Network reconstruction lies at the heart of phylogenetic research. Two well studied classes of phylogenetic networks include tree-child networks and level- networks. In a tree-c…

math.CO2018

Not all phylogenetic networks are leaf-reconstructible

Péter L. Erdős, Leo van Iersel, Mark Jones

Unrooted phylogenetic networks are graphs used to represent evolutionary relationships. Accurately reconstructing such networks is of great relevance for evolutionary biology. It h…

q-bio.PE2018

Polynomial-Time Algorithms for Phylogenetic Inference Problems involving duplication and reticulation

Leo van Iersel, Remie Janssen, Mark Jones +2

A common problem in phylogenetics is to try to infer a species phylogeny from gene trees. We consider different variants of this problem. The first variant, called Unrestricted Min…