1 citations · 1 across the 9 of their papers we have counts for
4 papers · 1 filter
A kernel for the maximum agreement forest problem on multiple binary phylogenetic trees
Steven Kelk, Ruben Meuwese, Leo van Iersel
The maximum agreement forest (MAF) problem in phylogenetics takes as input a set t >= 2 of binary phylogenetic trees T on the same set of taxa X. It asks for a partition of X into…
Snakes and Ladders: a Treewidth Story
Steven Chaplick, Steven Kelk, Ruben Meuwese +2
Let be an undirected graph. We say that contains a ladder of length if the grid graph is an induced subgraph of that is only connected to the rest…
Convex characters, algorithms and matchings
Steven Kelk, Ruben Meuwese, Stephan Wagner
Phylogenetic trees are used to model evolution: leaves are labelled to represent contemporary species ("taxa") and interior vertices represent extinct ancestors. Informally, convex…
Sharp upper and lower bounds on a restricted class of convex characters
Steven Kelk, Ruben Meuwese
Let be an unrooted binary tree with distinctly labelled leaves. Deriving its name from the field of phylogenetics, a convex character on is simply a…