Polylogarithmic approximation for edit distance and the asymmetric query complexity

Authors:
Alexandr Andoni;Robert Krauthgamer;Krzysztof Onak
Affiliations:
Princeton University and Center for Computational Intractability, Princeton, NJ;The Weizmann Institute of Science, Rehovot, Israel;Massachusetts Institute of Technology, Cambridge, MA
Venue:
Property testing
Year:
2010

Citing 24
Cited 0

Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Incremental String Comparison

SIAM Journal on Computing
The String-to-String Correction Problem

Journal of the ACM (JACM)
Approximate nearest neighbors and sequence comparison with block operations

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Communication complexity of document exchange

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Spot-checkers

Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
A guided tour to approximate string matching

ACM Computing Surveys (CSUR)
Space lower bounds for distance approximation in the data stream model

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Introduction to Algorithms

Introduction to Algorithms
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces

SIAM Journal on Computing
A sublinear algorithm for weakly approximating edit distance

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Algorithmic Applications of Low-Distortion Geometric Embeddings

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Approximating Edit Distance Efficiently

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Optimal approximations of the frequency moments of data streams

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Nonembeddability theorems via Fourier analysis

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Oblivious string embeddings and edit distance approximations

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Improved lower bounds for embeddings into L1

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The string edit distance matching problem with moves

ACM Transactions on Algorithms (TALG)
Low distortion embeddings for edit distance

Journal of the ACM (JACM)
Estimating the distance to a monotone function

Random Structures & Algorithms
Fast and compact regular expression matching

Theoretical Computer Science
Approximating edit distance in near-linear time

Proceedings of the forty-first annual ACM symposium on Theory of computing
Lower bounds for edit distance and product metrics via Poincaré-type inequalities

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The Computational Hardness of Estimating Edit Distance

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a near-linear time algorithm that approximates the edit distance between two strings within a polylogarithmic factor. More precisely, for strings of length n and every fixed ε 0, it can compute a (log n)O(1/ε) -approximation in n1+ε time. This result arises naturally in the study of a new asymmetric query model. In this model, the input consists of two strings x and y, and an algorithm can access y in an unrestricted manner, while being charged for querying every symbol of x. Our query lower bound for this model provides the first rigorous separation between edit distance and Ulam distance, which is edit distance on non-repetitive strings, i.e., permutations.