1 citations · 1 across the 9 of their papers we have counts for
10 papers
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…
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.…
Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests
David Mestel, Steven Chaplick, Steven Kelk +1
Phylogenetic trees are leaf-labelled trees used to model the evolution of species. In practice it is not uncommon to obtain two topologically distinct trees for the same set of spe…
Relaxed Agreement Forests
Virginia Aardevol Martinez, Steven Chaplick, Steven Kelk +3
There are multiple factors which can cause the phylogenetic inference process to produce two or more conflicting hypotheses of the evolutionary history of a set X of biological ent…
Agreement forests of caterpillar trees: complexity, kernelization and branching
Steven Kelk, Ruben Meuwese
Given a set of species, a phylogenetic tree is an unrooted binary tree whose leaves are bijectively labelled by . Such trees can be used to show the way species evolve over…
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…
Deep kernelization for the Tree Bisection and Reconnnect (TBR) distance in phylogenetics
Steven Kelk, Simone Linz, Ruben Meuwese
We describe a kernel of size 9k-8 for the NP-hard problem of computing the Tree Bisection and Reconnect (TBR) distance k between two unrooted binary phylogenetic trees. We achieve…
Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance
Steven Kelk, Simone Linz, Ruben Meuwese
The rooted subtree prune and regraft (rSPR) distance between two rooted binary phylogenetic trees is a well-studied measure of topological dissimilarity that is NP-hard to compute.…
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…