Abstract
We show that {0, 1}d endowed with edit distance embeds into ℓ1 with distortion 2O(√log d log log d). We further show efficient implementations 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 |
---|---|
Pages (from-to) | 218-224 |
Number of pages | 7 |
Journal | Proceedings of the Annual ACM Symposium on Theory of Computing |
DOIs | |
State | Published - 2005 |
Externally published | Yes |
Event | 13th Color Imaging Conference: Color Science, Systems, Technologies, and Applications - Scottsdale, AZ, United States Duration: 7 Nov 2005 → 11 Nov 2005 |
Keywords
- Edit distance
- Low distortion embeddings
- Metric spaces