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.
Original language | English |
---|---|
Article number | 23 |
Journal | Journal of the ACM |
Volume | 54 |
Issue number | 5 |
DOIs | |
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