Low distortion embeddings for edit distance

Rafail Ostrovsky; Yuval Rabani

doi:10.1145/1284320.1284322

Low distortion embeddings for edit distance

Rafail Ostrovsky^*, Yuval Rabani

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

72 Scopus citations

Abstract

We show that {0, 1} ^d endowed with edit distance embeds into ℓ ₁ with distortion 2 ^O(log d log log d). We further show efficient implementation of the embedding that yield solutions to various computational problems involving edit distance. These include sketching, communication complexity, nearest neighbor search. For all these problems, we improve upon previous bounds.

Original language	American English
Article number	23
Journal	Journal of the ACM
Volume	54
Issue number	5
DOIs	https://doi.org/10.1145/1284320.1284322
State	Published - 1 Oct 2007
Externally published	Yes

Keywords

Communication complexity
Computations on discrete structures
Dimension reduction
Edit distance
Levenshtein distance
Metric embeddings
Nearest neighbor search
Pattern matching
Sketching

Access to Document

10.1145/1284320.1284322

Cite this

@article{32daf9720b37444eb5a9e56e05bfef30,

title = "Low distortion embeddings for edit distance",

abstract = "We show that {0, 1} d endowed with edit distance embeds into ℓ 1 with distortion 2 O(log d log log d). We further show efficient implementation of the embedding that yield solutions to various computational problems involving edit distance. These include sketching, communication complexity, nearest neighbor search. For all these problems, we improve upon previous bounds.",

keywords = "Communication complexity, Computations on discrete structures, Dimension reduction, Edit distance, Levenshtein distance, Metric embeddings, Nearest neighbor search, Pattern matching, Sketching",

author = "Rafail Ostrovsky and Yuval Rabani",

year = "2007",

month = oct,

day = "1",

doi = "10.1145/1284320.1284322",

language = "American English",

volume = "54",

journal = "Journal of the ACM",

issn = "0004-5411",

publisher = "Association for Computing Machinery (ACM)",

number = "5",

}

TY - JOUR

T1 - Low distortion embeddings for edit distance

AU - Ostrovsky, Rafail

AU - Rabani, Yuval

PY - 2007/10/1

Y1 - 2007/10/1

N2 - We show that {0, 1} d endowed with edit distance embeds into ℓ 1 with distortion 2 O(log d log log d). We further show efficient implementation of the embedding that yield solutions to various computational problems involving edit distance. These include sketching, communication complexity, nearest neighbor search. For all these problems, we improve upon previous bounds.

AB - We show that {0, 1} d endowed with edit distance embeds into ℓ 1 with distortion 2 O(log d log log d). We further show efficient implementation of the embedding that yield solutions to various computational problems involving edit distance. These include sketching, communication complexity, nearest neighbor search. For all these problems, we improve upon previous bounds.

KW - Communication complexity

KW - Computations on discrete structures

KW - Dimension reduction

KW - Edit distance

KW - Levenshtein distance

KW - Metric embeddings

KW - Nearest neighbor search

KW - Pattern matching

KW - Sketching

UR - http://www.scopus.com/inward/record.url?scp=35348998047&partnerID=8YFLogxK

U2 - 10.1145/1284320.1284322

DO - 10.1145/1284320.1284322

M3 - Article

AN - SCOPUS:35348998047

SN - 0004-5411

VL - 54

JO - Journal of the ACM

JF - Journal of the ACM

IS - 5

M1 - 23

ER -

Low distortion embeddings for edit distance

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this