Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce

by   Mahdi Boroujeni, et al.
University of Maryland
Sharif Accelerator

The edit distance between two strings is defined as the smallest number of insertions, deletions, and substitutions that need to be made to transform one of the strings to another one. Approximating edit distance in subquadratic time is "one of the biggest unsolved problems in the field of combinatorial pattern matching". Our main result is a quantum constant approximation algorithm for computing the edit distance in truly subquadratic time. More precisely, we give an O(n^1.858) quantum algorithm that approximates the edit distance within a factor of 7. We further extend this result to an O(n^1.781) quantum algorithm that approximates the edit distance within a larger constant factor. Our solutions are based on a framework for approximating edit distance in parallel settings. This framework requires as black box an algorithm that computes the distances of several smaller strings all at once. For a quantum algorithm, we reduce the black box to metric estimation and provide efficient algorithms for approximating it. We further show that this framework enables us to approximate edit distance in distributed settings. To this end, we provide a MapReduce algorithm to approximate edit distance within a factor of 3, with sublinearly many machines and sublinear memory. Also, our algorithm runs in a logarithmic number of rounds.


page 1

page 2

page 3

page 4


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...

Sublinear Algorithms for Gap Edit Distance

The edit distance is a way of quantifying how similar two strings are to...

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

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

On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings

Edit distance is a fundamental measure of distance between strings and h...

Imagined-Trailing-Whitespace-Agnostic Levenshtein Distance For Plaintext Table Detection

The standard algorithm for Levenshtein distance, treats trailing whitesp...

Quantum Linear Algorithm for Edit Distance Using the Word QRAM Model

Many problems that can be solved in quadratic time have bit-parallel spe...

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