On Two Measures of Distance between Fully-Labelled Trees

02/13/2020
by   Giulia Bernardini, et al.
0

The last decade brought a significant increase in the amount of data and a variety of new inference methods for reconstructing the detailed evolutionary history of various cancers. This brings the need of designing efficient procedures for comparing rooted trees representing the evolution of mutations in tumor phylogenies. Bernardini et al. [CPM 2019] recently introduced a notion of the rearrangement distance for fully-labelled trees motivated by this necessity. This notion originates from two operations: one that permutes the labels of the nodes, the other that affects the topology of the tree. Each operation alone defines a distance that can be computed in polynomial time, while the actual rearrangement distance, that combines the two, was proven to be NP-hard. We answer two open question left unanswered by the previous work. First, what is the complexity of computing the permutation distance? Second, is there a constant-factor approximation algorithm for estimating the rearrangement distance between two arbitrary trees? We answer the first one by showing, via a two-way reduction, that calculating the permutation distance between two trees on n nodes is equivalent, up to polylogarithmic factors, to finding the largest cardinality matching in a sparse bipartite graph. In particular, by plugging in the algorithm of Mądry [FOCS 2013], we obtain an O(n^10/7) time algorithm for computing the permutation distance between two trees on n nodes. Then we answer the second question positively, and design a linear-time constant-factor approximation algorithm that does not need any assumption on the trees.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/02/2019

A rearrangement distance for fully-labelled trees

The problem of comparing trees representing the evolutionary histories o...
research
04/05/2020

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

Maximum parsimony distance is a measure used to quantify the dissimilari...
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
03/15/2018

The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics

A multilabeled tree (or MUL-tree) is a rooted tree in which every leaf i...
research
11/15/2018

Computing Quartet Distance is Equivalent to Counting 4-Cycles

The quartet distance is a measure of similarity used to compare two unro...
research
02/05/2021

Reconstructing Arbitrary Trees from Traces in the Tree Edit Distance Model

In this paper, we consider the problem of reconstructing trees from trac...
research
01/14/2001

An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings

A widely used method for determining the similarity of two labeled trees...

Please sign up or login with your details

Forgot password? Click here to reset