Rafail Ostrovsky
ABSTRACT
We show that 0,1d endowed with edit distance embeds into l1 with distortion 2O(√log dlog 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.
- A. Andoni, M. Deza, A. Gupta, P. Indyk, and S. Raskhodnikova. Lower bounds for embedding edit distance into normed spaces. In Proc. SODA 2003, pages 523--526. Google Scholar
Digital Library
- Z. Bar-Yossef, T.S. Jayram, R. Krauthgamer, and R. Kumar. Approximating edit distance efficiently. In Proc. FOCS 2004. Google ScholarDigital Library
- T. Batu, F. Ergun, J. Kilian, A. Magen, S. Raskhodnikova, R. Rubinfeld, and R. Sami. A sublinear algorithm for weakly approximating edit distance. In Proc. STOC 2003. Google ScholarDigital Library
- A. Broder, S. Glassman, M. Manasse, and G. Zweig. Syntactic clustering of the Web. In Proc. of the 6th Int'l World Wide Web Conf., 1997, pages 391--404. Google ScholarDigital Library
- G. Cormode and S. Muthukrishnan. The string edit distance matching problem with moves. In Proc. SODA 2002, pages 667--676. Google ScholarDigital Library
- G. Cormode, M. Paterson, C.S. Sahinalp, and U. Vishkin. Communication complexity of document exchange. In Proc. SODA 2000. Google ScholarDigital Library
- P. Indyk. Approximate nearest neighbor under edit distance via product metrics. In Proc. SODA 2004, pages 646--650. Google ScholarDigital Library
- P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proc. STOC 1998, pages 604--613. Google ScholarDigital Library
- E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM Journal on Computing, 30(2):457--474, 2000. (Preliminary version appeared in Proc. STOC 1998.) Google ScholarDigital Library
- V.I. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Doklady Akademii Nauk SSSR, 163(4):845--848, 1965 (Russian). English translation in Soviet Physics Doklady, 10(8):707--710, 1966.Google Scholar
- W.J. Masek and M.S. Paterson. A faster algorithm for computing string edit distnace. Journal of Computer and Systems Sciences, 20(1):18-31, 1980.Google ScholarCross Ref
- S. Muthukrishnan and S.C. Sahinalp. Approximate nearest neighbors and sequence comparison with block operations. In Proc. STOC 2000, pages 416--424. Google ScholarDigital Library
Index Terms
- Low distortion embeddings for edit distance
Recommendations
Low distortion embeddings for edit distance
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 implementation of the embedding that yield solutions to various computational problems involving edit distance. These include ...
Streaming algorithms for embedding and computing edit distance in the low distance regime
STOC '16: Proceedings of the forty-eighth annual ACM symposium on Theory of ComputingThe Hamming and the edit metrics are two common notions of measuring distances between pairs of strings x,y lying in the Boolean hypercube. The edit distance between x and y is defined as the minimum number of character insertion, deletion, and bit ...
Improved MPC Algorithms for Edit Distance and Ulam Distance
SPAA '19: The 31st ACM Symposium on Parallelism in Algorithms and ArchitecturesEdit distance is one of the most fundamental problems in combinatorial optimization. Ulam distance is a special case of edit distance where no character is allowed to appear more than once in a string. Recent developments have been very fruitful for ...
Comments