Thumbnail
Access Restriction
Subscribed

Author Ostrovsky, Rafail ♦ Rabani, Yuval
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2007
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Levenshtein distance ♦ Pattern matching ♦ Communication complexity ♦ Computations on discrete structures ♦ Dimension reduction ♦ Edit distance ♦ Metric embeddings ♦ Nearest neighbor search ♦ Sketching
Abstract We show that {0, $1}^{d}$ endowed with edit distance embeds into $ℓ_{1}$ with distortion $2^{O}(&sqrt;log$ $\textit{d}$ log log $\textit{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.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2007-10-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 54
Issue Number 5


Open content in new tab

   Open content in new tab
Source: ACM Digital Library