Faster Algorithms for Bounded Tree Edit Distance

05/06/2021
by   Shyan Akmal, et al.
0

Tree edit distance is a well-studied measure of dissimilarity between rooted trees with node labels. It can be computed in O(n^3) time [Demaine, Mozes, Rossman, and Weimann, ICALP 2007], and fine-grained hardness results suggest that the weighted version of this problem cannot be solved in truly subcubic time unless the APSP conjecture is false [Bringmann, Gawrychowski, Mozes, and Weimann, SODA 2018]. We consider the unweighted version of tree edit distance, where every insertion, deletion, or relabeling operation has unit cost. Given a parameter k as an upper bound on the distance, the previous fastest algorithm for this problem runs in O(nk^3) time [Touzet, CPM 2005], which improves upon the cubic-time algorithm for k≪ n^2/3. In this paper, we give a faster algorithm taking O(nk^2 log n) time, improving both of the previous results for almost the full range of log n ≪ k≪ n/√(log n).

READ FULL TEXT

page 1

page 3

page 7

page 13

research
06/03/2021

Breaking the Cubic Barrier for (Unweighted) Tree Edit Distance

The (unweighted) tree edit distance problem for n node trees asks to com...
research
01/20/2022

JEDI: These aren't the JSON documents you're looking for... (Extended Version*)

The JavaScript Object Notation (JSON) is a popular data format used in d...
research
09/15/2022

Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance

Computing the edit distance of two strings is one of the most basic prob...
research
04/26/2018

Edit Distance between Unrooted Trees in Cubic Time

Edit distance between trees is a natural generalization of the classical...
research
05/03/2019

RLE edit distance in near optimal time

We show that the edit distance between two run-length encoded strings of...
research
05/11/2021

Tree Edit Distance with Variables. Measuring the Similarity between Mathematical Formulas

In this article, we propose tree edit distance with variables, which is ...
research
04/21/2022

Time Window Frechet and Metric-Based Edit Distance for Passively Collected Trajectories

The advances of modern localization techniques and the wide spread of mo...

Please sign up or login with your details

Forgot password? Click here to reset