NDLI: The Computational Hardness of Estimating Edit Distance [Extended Abstract]

Content Provider	IEEE Xplore Digital Library
Author	Andon, A. Krauthgamer, R.
Copyright Year	2007
Description	Author affiliation: Massachusetts Inst. of Technol., Cambridge (Andon, A.)
Abstract	We prove the first non-trivial communication complexity lower bound for the problem of estimating the edit distance (aka Levenshtein distance) between two strings. A major feature of our result is that it provides the first setting in which the complexity of computing the edit distance is provably larger than that of Hamming distance. Our lower bound exhibits a trade-off between approximation and communication, asserting, for example, thai protocols with O(1) bits of communication can only obtain approximation a ges Omega(log d/log log d), where d is the length of the input strings. This case of O(1) communication is of particular importance, since it captures constant-size sketches as well as embaddings into spaces like $L_{1}$ and $squared-L_{2}.$ two prevailing algorithmic approaches for dealing with edit distance. Furthermore, the bound holds not only for strings over alphabet Sigma= {0, 1}, but also for strings that are permu-tations (called the Ulam metric). Besides being applicable to a much richer class of algorithms than all previous results, our bounds are near-tight in at. least one case, namely of embedding permutations into $L_{1}.$ The proof uses a new technique, that relies on Fourier analysis in a rather elementary way.
Starting Page	724
Ending Page	734
File Size	345895
Page Count	11
File Format	PDF
ISBN	9780769530109
ISSN	02725428
DOI	10.1109/FOCS.2007.60
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-10-21
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Hamming distance Approximation algorithms Polynomials Computational biology Biology computing Algorithm design and analysis Nearest neighbor searches Computational modeling Computer science Complexity theory
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Hardness of Nearest Neighbor under L-infinity

A Fast Approximate Nearest Neighbor Search Algorithm in the Hamming Space

Fast Algorithm for Approximate k-Nearest Neighbor Graph Construction

Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity

The Shared Nearest Neighbor Algorithm with Enclosures (SNNAE)

An Approximate Nearest Neighbor Query Algorithm Based on Hilbert Curve

The Computational Hardness of Estimating Edit Distance

Group Enclosing Queries

An analytical comparison of nearest neighbor algorithms for load balancing in parallel computers

The Computational Hardness of Estimating Edit Distance [Extended Abstract]

Similar Documents

Hardness of Nearest Neighbor under L-infinity

A Fast Approximate Nearest Neighbor Search Algorithm in the Hamming Space

Fast Algorithm for Approximate k-Nearest Neighbor Graph Construction

Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity

The Shared Nearest Neighbor Algorithm with Enclosures (SNNAE)

An Approximate Nearest Neighbor Query Algorithm Based on Hilbert Curve

The Computational Hardness of Estimating Edit Distance

Group Enclosing Queries

An analytical comparison of nearest neighbor algorithms for load balancing in parallel computers

The Computational Hardness of Estimating Edit Distance [Extended Abstract]