Low distortion embeddings for edit distance

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 218-224

  Ostrovsky, Rafail ^a   Rabani, Yuval ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Edit distance; Low distortion embeddings; Metric spaces

Indexed keywords

COMPUTATIONAL COMPLEXITY; METRIC SYSTEM; PROBLEM SOLVING; SEARCH ENGINES;

EDIT DISTANCE; LOW DISTORTION EMBEDDINGS; METRIC SPACES;

EMBEDDED SYSTEMS;

EID: 33244472491     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060623     Document Type: Conference Paper

References (14)

1. 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.
2. Z. Bar-Yossef, T.S. Jayram, R. Krauthgamer, and R. Kumar. Approximating edit distance efficiently. In Proc. FOCS 2004.
3. 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.
4. 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.
5. G. Cormode and S. Muthukrishnan. The string edit distance matching problem with moves. In Proc. SODA 2002, pages 667-676.
6. G. Cormode, M. Paterson, C.S. Sahinalp, and U. Vishkin. Communication complexity of document exchange. In Proc. SODA 2000.
7. P. Indyk. Approximate nearest neighbor under edit distance via product metrics. In Proc. SODA 2004, pages 646-650.
8. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proc. STOC 1998, pages 604-613.
9. 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.
10. (Preliminary version appeared in Proc. STOC 1998.)
11. V.I. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Doklady Akademii Nauk SSSR, 163(4):845-848, 1965 (Russian).
12. English translation in Soviet Physics Doklady, 10(8):707-710, 1966.
13. 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.
14. S. Muthukrishnan and S.C. Sahinalp. Approximate nearest neighbors and sequence comparison with block operations. In Proc. STOC 2000, pages 416-424.