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

11 citations · 33 across the 6 of their papers we have counts for

collaborators
Showing q-bio.PEShow all

5 papers · 1 filter

q-bio.PE2009

A Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks

Katharina T. Huber, Leo van Iersel, Steven Kelk +1

Recently much attention has been devoted to the construction of phylogenetic networks which generalize phylogenetic trees in order to accommodate complex evolutionary processes. He…

q-bio.PE200911 cited

Phylogenetic Networks Do not Need to Be Complex: Using Fewer Reticulations to Represent Conflicting Clusters

Leo van Iersel, Steven Kelk, Regula Rupp +1

Phylogenetic trees are widely used to display estimates of how groups of species evolved. Each phylogenetic tree can be seen as a collection of clusters, subgroups of the species t…

q-bio.PE20087 cited

Constructing the Simplest Possible Phylogenetic Network from Triplets

Leo van Iersel, Steven Kelk

A phylogenetic network is a directed acyclic graph that visualises an evolutionary history containing so-called reticulations such as recombinations, hybridisations or lateral gene…

q-bio.PE20072 cited

Uniqueness, intractability and exact algorithms: reflections on level-k phylogenetic networks

Leo van Iersel, Steven Kelk, Matthias Mnich

Phylogenetic networks provide a way to describe and visualize evolutionary histories that have undergone so-called reticulate evolutionary events such as recombination, hybridizati…

q-bio.PE20079 cited

Constructing level-2 phylogenetic networks from triplets

Leo van Iersel, Judith Keijsper, Steven Kelk +1

Jansson and Sung showed that, given a dense set of input triplets T (representing hypotheses about the local evolutionary relationships of triplets of species), it is possible to d…