Low distortion embeddings for edit distance

Journal of the ACM

Volumn 54, Issue 5, 2007, Pages

  Ostrovsky, Rafail ^a   Rabani, Yuval ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Communication complexity; Computations on discrete structures; Dimension reduction; Edit distance; Levenshtein distance; Metric embeddings; Nearest neighbor search; Pattern matching; Sketching

Indexed keywords

COMMUNICATION COMPLEXITY; COMPUTATIONS ON DISCRETE STRUCTURES; DIMENSION REDUCTION; EDIT DISTANCE; LEVENSHTEIN DISTANCES; METRIC EMBEDDINGS; NEAREST NEIGHBOR SEARCH; SKETCHING;

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; SEARCH ENGINES;

EMBEDDED SYSTEMS;

EID: 35348998047     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1284320.1284322     Document Type: Article

References (16)

1. ANDONI, A., DEZA, M., GUPTA, A., NDYK, P., AND RASKHODNIKOVA, S. 2003. Lower bounds for embedding edit distance into normed spaces. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, 523-526.
2. BAR-YOSSEF, Z., JAYRAM, T. S., KRAUTHGAMER, R., AND KUMAR, R. 2004. Approximating edit distance efficiently. In Proceedings of the Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA.
3. BATU, T., ERGUN, E., KILIAN, J., MAGEN, A., RASKHODNIKOVA, S., RUBINFELD, R. AND SAMI, R. 2003. A sublinear algorithm for weakly approximating edit distance. In Proceedings of the Symposium on Theory of Computing. ACM, New York.
4. BRODER, A., GLASSMAN, S., MANASSE, M., AND ZWEIG, G. 1997. Syntactic clustering of the Web. In Proc. of the 6th International World Wide Web Conference, 391-404.
5. CORMODE, G., AND MUTHUKRISHNAN, S. 2002. The string edit distance matching problem with moves. In Proceedings of the Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA. 667-676.
6. CORMODE, G., PATERSON, M., SAHINALP, C. S., AND VISHKIN, U. 2000. Communication complexity of document exchange. In Proceedings of the Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA.
7. INDYK, P. 2004. Approximate nearest neighbor under edit distance via product metrics. In Proceedings of the Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA. 646-650.
8. INDYK, P., AND MOTWANI, R. 1998. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proceedings of the Symposium on Theory of Computing. ACM, New York. 604-613.
9. KHOT, S., AND NAOR, A. 2005. Nonembeddability theorems via Fourier analysis. In Proceedings of the Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA.
10. 1. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, ACM, New York.
11. KUSHILEVITZ, E., OSTROVSKY, R., AND RABANI, Y. 2000. Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM J. Comput. 30, 2, 457-474.
12. (Preliminary version appeared in Proceedings of the Symposium on Theory of Computing. ACM, New York.)
13. LEVENSHTEIN, V. I. 1965. Binary codes capable of correcting deletions, insertions, and reversals. Doklady Akademii Nauk SSSR, 163, 4, 845-848 (Russian).
14. (English translation in Soviet Physics Doklady 10, 8, 707-710, 1996.)
15. MASEK, W. J., AND PATERSON, M. S. 1980. A faster algorithm for computing string edit distnace. J. Comput. Syst. Sci. 20, 1, 18-31.
16. MUTHUKRISHNAN, S., AND SAHINALP, S. C. 2000. Approximate nearest neighbors and sequence comparison with block operations. In Proceedings of the Symposium on Theory of Computing. ACM, New York., 416-424.