Papers
Topics
Authors
Recent
Search
2000 character limit reached

An Improved Algorithm for The kk-Dyck Edit Distance Problem

Published 3 Nov 2021 in cs.DS | (2111.02336v2)

Abstract: A Dyck sequence is a sequence of opening and closing parentheses (of various types) that is balanced. The Dyck edit distance of a given sequence of parentheses SS is the smallest number of edit operations (insertions, deletions, and substitutions) needed to transform SS into a Dyck sequence. We consider the threshold Dyck edit distance problem, where the input is a sequence of parentheses SS and a positive integer kk, and the goal is to compute the Dyck edit distance of SS only if the distance is at most kk, and otherwise report that the distance is larger than kk. Backurs and Onak [PODS'16] showed that the threshold Dyck edit distance problem can be solved in O(n+k16)O(n+k^{16}) time. In this work, we design new algorithms for the threshold Dyck edit distance problem which costs O(n+k4.544184)O(n+k^{4.544184}) time with high probability or O(n+k4.853059)O(n+k^{4.853059}) deterministically. Our algorithms combine several new structural properties of the Dyck edit distance problem, a refined algorithm for fast (min⁡,+)(\min,+) matrix product, and a careful modification of ideas used in Valiant's parsing algorithm.

Citations (10)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.