Maximum parsimony distance on phylogenetictrees: a linear kernel and constant factor approximation algorithm

04/05/2020
by   Mark Jones, et al.
0

Maximum parsimony distance is a measure used to quantify the dissimilarity of two unrooted phylogenetic trees. It is NP-hard to compute, and very few positive algorithmic results are known due to its complex combinatorial structure. Here we address this shortcoming by showing that the problem is fixed parameter tractable. We do this by establishing a linear kernel i.e., that after applying certain reduction rules the resulting instance has size that is bounded by a linear function of the distance. As powerful corollaries to this result we prove that the problem permits a polynomial-time constant-factor approximation algorithm; that the treewidth of a natural auxiliary graph structure encountered in phylogenetics is bounded by a function of the distance; and that the distance is within a constant factor of the size of a maximum agreement forest of the two trees, a well studied object in phylogenetics.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/14/2018

A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest

We give a 2-approximation algorithm for the Maximum Agreement Forest pro...
research
11/01/2022

A Near-Linear Kernel for Two-Parsimony Distance

The maximum parsimony distance d_MP(T_1,T_2) and the bounded-state maxim...
research
02/13/2020

On Two Measures of Distance between Fully-Labelled Trees

The last decade brought a significant increase in the amount of data and...
research
11/06/2018

FPT-algorithms for computing Gromov-Hausdorff and interleaving distances between trees

Gromov-Hausdorff (GH) distance is a natural way to measure the distortio...
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
02/16/2022

SAT Backdoors: Depth Beats Size

For several decades, much effort has been put into identifying classes o...
research
12/30/2019

Approximating Gromov-Hausdorff Distance in Euclidean Space

The Gromov-Hausdorff distance (d_GH) proves to be a useful distance meas...

Please sign up or login with your details

Forgot password? Click here to reset