Low distortion embeddings for edit distance

Rafail Ostrovsky, Yuval Rabani
2005 Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05  
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 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.
doi:10.1145/1060590.1060623 dblp:conf/stoc/OstrovskyR05 fatcat:lwrbowsowjhj7mw7f2avkajbbm