The computational hardness of estimating edit distance

SIAM Journal on Computing

Volumn 39, Issue 6, 2010, Pages 2398-2429

  Andoni, Alexandr ^a   Krauthgamer, Robert ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Communication complexity; Edit distance; Embedding; Fourier analysis; Sketching; Ulam metric

Indexed keywords

ALGORITHMIC APPROACH; BINARY ALPHABETS; COMMUNICATION COMPLEXITY; COMMUNICATION PROTOCOLS; COMPUTATIONAL HARDNESS; COMPUTATIONAL SETTINGS; EDIT DISTANCE; EMBEDDINGS; INPUT STRING; LEVENSHTEIN DISTANCE; LOWER BOUNDS; UPPER BOUND;

COMMUNICATION; ESTIMATION; FOURIER ANALYSIS; FOURIER TRANSFORMS;

HAMMING DISTANCE;

EID: 77952244105     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/080716530     Document Type: Article

References (36)

1. A. ANDONI, M. Deza, A. GUPTA, P. INDYK, AND S. RaskhoDNIKOVA, Lower bounds for embedding edit distance into normed spaces, in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003, pp. 523-526.
2. A. ANDONI, P. INDYK, AND R. KRAUTHGAMER, Earth mover distance over high-dimensional spaces, in Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2008, pp. 343-352.
3. A. ANDONI, P. INDYK, AND R. KRAUTHGAMER, Overcoming the l1 non-embeddability barrier: Algorithms for product metrics, in Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2009, pp. 865-874.
4. A. ANDONI, T.S. JAYRAM, AND M. PǍTRAŞCU, Lower bounds for edit distance and product metrics via Poincaré-type inequalities, in Proceedings of the Twenty-First ACM-SIAM Symposium on Discrete Algorithms (SODA), 2010, pp. 184-192.
5. A. ANDONI AND K. Onak, Approximating edit distance in near-linear time, in Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), 2009, pp. 199-204.
6. Z. BAR-YOSSEF, T.S. JAYRAM, R. KRAUTHGAMER, AND R. KUMAR, Approximating edit distance efficiently, in Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2004, pp. 550-559.
7. Z. BAR-YOSSEF, T.S. JAYRAM, R. KUMAR, AND D. SIVAKUMAR, An information statistics approach to data stream and communication complexity, J. Comput. System Sci., 68 (2004), pp. 702-732.
8. T. Batu, F. Ergün, J. Kilian, A. Magen, S. RASKHODNiKovA, R. Rubinfeld, and R. Sami, A sublinear algorithm for weakly approximating edit distance, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), 2003, pp. 316-324.
9. T. BATU, F. ERGÜN, AND C. SAHINALP, Oblivious string embeddings and edit distance approximations, in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006, pp. 792-801.
10. P. BILLE AND M. FARACH-COLTON, Fast and compact regular expression matching,Theoret. Comput. Sci., 409 (2008), pp. 486-496.
11. J. BOURGAIN, On the distributions of the Fourier spectrum of Boolean functions, Israel J. Math., 131 (2002), pp. 269-276.
12. 1, Theory of Computing, 2 (2006), pp. 207-224.
13. G. CORMODE, Sequence Distance Embeddings, Ph.D. thesis, University of Warwick, Coventry, UK, 2003.
14. G. CORMODE AND S. MUTHUKRISHNAN, The string edit distance matching problem with moves, ACM Trans. Algorithms, 3 (2007), art. 2.
15. G. CORMODE, M. PATERSON, S.C. Sahinalp, AND U. VISHKIN, Communication complexity of document exchange, in Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2000, pp. 197-206.
16. M.M. Deza AND M. LAURENT, Geometry of Cuts and Metrics, Springer-Verlag, Berlin, 1997.
17. P. GOPALAN, T.S. JAYRAM, R. KRAUTHGAMER, AND R. KUMAR, Estimating the sortedness of a data stream, in Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007, pp. 318-327.
18. P. INDYK, Algorithmic aspects of geometric embeddings (tutorial), in Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2001, pp. 10-33.
19. P. INDYK, Approximate nearest neighbor under edit distance via product metrics, in Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004, pp. 646-650.
20. P. INDYK AND R. MOTWANI, Approximate nearest neighbor: Towards removing the curse of dimensionality, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC), 1998, pp. 604-613.
21. J. KAHN, G. KALAI, AND N. LINIAL, The influence of variables on boolean functions, in Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1988, pp. 68-80.
22. S. KHOT AND A. NAOR, Nonembeddability theorems via Fourier analysis, Math. Ann., 334 (2006), pp. 821-852.
23. R. KRAUTHGAMER AND Y. RABANI, Improved lower bounds for embeddings into L1, in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006, pp. 1010-1017.
24. E. KUSHILEVITZ, R. OSTROVSKY, AND Y. RABANI, Efficient search for approximate nearest neighbor in high dimensional spaces, SIAM J. Comput., 30 (2000), pp. 457-474.
25. W.J. MASEK AND M. PATERSON, A faster algorithm computing string edit distances, J. Comput. System Sci., 20 (1980), pp. 18-31.
26. J. MatouŠek, Collection of Open Problems on Low-Distortion Embeddings of Finite Metric Spaces, http://kam.mff.cuni.cz/~matousek/metrop.ps (2007).
27. R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Cambridge University Press, Cambridge, UK, 1995.
28. S. MUTHUKRISHNAN AND C. SAHINALP, Approximate nearest neighbors and sequence comparison with block operations, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), 2000, pp. 416-424.
29. R. OSTROVSKY AND Y. RABANI, Low distortion embedding for edit distance, J. ACM, 54 (2007), art. 23.
30. C. SAHINALP AND A. UTIS, Hardness of string similarity search and other indexing problems,in Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), 2004, pp. 1080-1098.
31. S.C. SAHINALP, Edit distance under block operations, in Encyclopedia of Algorithms, Ming- Yang Kao, ed., Springer, Berlin, Heidelberg, 2008.
32. M. SAKS AND X. SUN, Space lower bounds for distance approximation in the data stream model, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), 2002, pp. 360-369.
33. I.J. SCHOENBERG, Metric spaces and positive definite functions, Trans. Amer. Math. Soc., 44 (1938), pp. 522-536.
34. C.K. WONG AND A.K. CHANDRA, Bounds for the string editing problem, J. ACM, 23 (1976), pp. 13-16.
35. D. P. WOODRUFF, Optimal space lower bounds for all frequency moments, in Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004, pp. 167-175.
36. D. WOODRUFF, Efficient and Private Distance Approximation in the Communication and Streaming Models, Ph.D. thesis, MIT, Cambridge, MA, 2007.