AI Chat AI Image Generator AI Video Text to Speech

Constant-factor approximation of near-linear edit distance in near-linear time

04/10/2019

∙

by Joshua Brakensiek, et al.

∙

∙

We show that the edit distance between two strings of length n can be computed within a factor of f(ϵ) in n^1+ϵ time as long as the edit distance is at least n^1-δ for some δ(ϵ) > 0.

Joshua Brakensiek
17 publications
Aviad Rubinstein
36 publications

research

∙ 05/15/2020

Edit Distance in Near-Linear Time: it's a Constant Factor

We present an algorithm for approximating the edit distance between two ...

0 Alexandr Andoni, et al. ∙

research

∙ 10/08/2018

Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time

Edit distance is a measure of similarity of two strings based on the min...

0 Diptarka Chakraborty, et al. ∙

research

∙ 04/10/2019

Constant factor approximations to edit distance on far input pairs in nearly linear time

For any T ≥ 1, there are constants R=R(T) ≥ 1 and ζ=ζ(T)>0 and a randomi...

0 Michal Koucký, et al. ∙

research

∙ 05/03/2019

RLE edit distance in near optimal time

We show that the edit distance between two run-length encoded strings of...

0 Raphael Clifford, et al. ∙

research

∙ 10/28/2018

Near-Linear Time Insertion-Deletion Codes and (1+ε)-Approximating Edit Distance via Indexing

We introduce fast-decodable indexing schemes for edit distance which can...

0 Bernhard Haeupler, et al. ∙

research

∙ 04/10/2019

Reducing approximate Longest Common Subsequence to approximate Edit Distance

Given a pair of strings, the problems of computing their Longest Common ...

0 Aviad Rubinstein, et al. ∙

research

∙ 12/06/2013

Towards Normalizing the Edit Distance Using a Genetic Algorithms Based Scheme

The normalized edit distance is one of the distances derived from the ed...

0 Muhammad Marwan Muhammad Fuad, et al. ∙