18 citations · 79 across the 28 of their papers we have counts for
3 papers · 2 filters
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.…
A QUBO formulation for the Tree Containment problem
Michael J. Dinneen, Pankaj S. Ghodla, Simone Linz
Phylogenetic (evolutionary) trees and networks are leaf-labeled graphs that are widely used to represent the evolutionary relationships between entities such as species, languages,…