A tight kernel for computing the tree bisection and reconnection distance between two phylogenetic trees

11/16/2018
by   Steven Kelk, et al.
0

In 2001 Allen and Steel showed that, if subtree and chain reduction rules have been applied to two unrooted phylogenetic trees, the reduced trees will have at most 28k taxa where k is the TBR (Tree Bisection and Reconnection) distance between the two trees. Here we reanalyse Allen and Steel's kernelization algorithm and prove that the reduced instances will in fact have at most 15k-9 taxa. Moreover we show, by describing a family of instances which have exactly 15k-9 taxa after reduction, that this new bound is tight. These instances also have no common clusters, showing that a third commonly-encountered reduction rule, the cluster reduction, cannot further reduce the size of the kernel in the worst case. To achieve these results we introduce and use "unrooted generators" which are analogues of rooted structures that have appeared earlier in the phylogenetic networks literature. Using similar argumentation we show that, for the minimum hybridization problem on two rooted trees, 9k-2 is a tight bound (when subtree and chain reduction rules have been applied) and 9k-4 is a tight bound (when, additionally, the cluster reduction has been applied) on the number of taxa, where k is the hybridization number of the two trees.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/04/2019

New reduction rules for the tree bisection and reconnection distance

Recently it was shown that, if the subtree and chain reduction rules hav...
research
02/20/2022

Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance

The rooted subtree prune and regraft (rSPR) distance between two rooted ...
research
12/14/2020

Reflections on kernelizing and computing unrooted agreement forests

Phylogenetic trees are leaf-labelled trees used to model the evolution o...
research
06/09/2022

Deep kernelization for the Tree Bisection and Reconnnect (TBR) distance in phylogenetics

We describe a kernel of size 9k-8 for the NP-hard problem of computing t...
research
01/17/2020

Counting difficult tree pairs with respect to the rotation distance problem

Rotation distance between rooted binary trees is the minimum number of s...
research
06/29/2022

There and Back Again: On Applying Data Reduction Rules by Undoing Others

Data reduction rules are an established method in the algorithmic toolbo...
research
05/12/2023

Reduced Label Complexity For Tight ℓ_2 Regression

Given data X∈ℝ^n× d and labels 𝐲∈ℝ^n the goal is find 𝐰∈ℝ^d to minimize ...

Please sign up or login with your details

Forgot password? Click here to reset