The computational hardness of estimating edit distance

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 724-734

  Andoni, Alexandr ^a   Krauthgamer, Robert ^b  

^a Dept of Aeronautics and Astronautics

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

(ALGORITHMIC) COMPLEXITY; COMMUNICATION COMPLEXITIES; COMPUTATIONAL HARDNESS; EDIT DISTANCES; EMBEDDINGS; INPUT STRINGS; LEVENSHTEIN DISTANCES; LOWER BOUNDS; NON-TRIVIAL;

COMPUTER SCIENCE; CONTROL THEORY; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; MILITARY DATA PROCESSING; POLYNOMIAL APPROXIMATION;

COMMUNICATION;

EID: 46749125378     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389540     Document Type: Conference Paper

References (27)

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 ACM-SIAM Symposium on Discrete Algorithms, pages 523-526, 2003.
2. A. Andoni, P. Indyk, and R. Krauthgamer. Earth, mover distance over high-dimensional spaces. ECCC Report TR07-048, May 2007.
3. Z. Bar-Yossef, T. S. Jayram, R. Krauthgamer, and R. Kumar. Approximating edit distance efficiently. In 45th Annual IEEE Symposium on Foundations of Computer Science, pages 550-559, Oct. 2004.
4. Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci., 68(4):702-732, 2004.
5. 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 Symposium on Theory of Computing, pages 316-324, 2003.
6. T. Batu, F. Ergün, and C. Sahinalp. Oblivious string embeddings and edit distance approximations. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 792-801, 2006.
7. J. Bourgain. On the distributions of the Fourier spectrum of Boolean, functions. Israel J. Math., 131:269-276, 2002.
8. 1. Theory of Computing, 2(11):207-224, 2006.
9. G. Cormode. Sequence Distance Embeddings. Ph.D. Thesis. University of Warwick, 2003.
10. G. Cormode and S. Muthukrishnan. The string edit distance matching problem with moves. ACM Trans. Algorithms, 3(1):2, 2007.
11. G. Cormode, M. Paterson, S. C. Sahinalp, and U. Vishkin. Communication complexity of document exchange. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 197-206, 2000.
12. P. Gopalan, T. S. Jayram, R. Krauthgamer, and R. Kumar. Estimating the sortedness of a data stream. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2007.
13. P. Indyk. Tutorial: Algorithmic applications of low-distortion geometric embeddings. Proceedings of the Symposium on Foundations of Computer Science, pages 10-33, 2001.
14. P. Indyk. Approximate nearest neighbor under edit distance via product metrics. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 646-650, 2004.
15. P. Indyk and R. Motwani. Approximate nearest neighbor: towards removing the curse of dimensionality. Proceedings of the Symposium, on Theory of Computing, pages 604-613, 1998.
16. J. Kahn, G. Kalai, and N. Linial. The influence of variables on boolean, functions. In Proceedings of the Symposium on Foundations of Computer Science, pages 68-80, 1988.
17. S. Khot and A. Naor. Nonembeddability theorems via fourier analysis. Mathematische Annaten, 334(4):821-852, 2006.
18. 1. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm, pages 1010-1017, 2006.
19. E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. Proceedings of the 30th A CM Symposium on Theory of Computing, pages 614 623, 1998.
20. W. J. Masek and M. Paterson. A faster algorithm computing string edit distances. J. Comput. Syst. Sci., 20(1):18-31, 1980.
21. J. Matoušek. Collection of open problems on low-distortion embeddings of finite metric spaces. March 2007. Available online. Last access in August, 2007.
22. S. Muthukrishnan and C. Sahinalp. Approximate nearest neighbors and sequence comparison with block operations. Proceedings of the Symposium on Theory of Computing, pages 416-424, 2000.
23. R. Ostrovsky and Y. Rabani. Low distortion embedding for edit distance. In Proceedings of the Symposium, on Theory of Computing, pages 218-224, 2005.
24. C. Sahinalp. Edit distance under block operations. Encyclopedia of Algorithms (Ming Yang Kao, ed.). Springer. Forthcoming, available online. Last access in August, 2007.
25. C. Sahinalp and A. Utis. Hardness of string similarity search and other indexing problems. In Proceedings of International Colloquium on Automata, Languages and Programming (ICALP), pages 1080 1098, 2004.
26. M. Saks and X. Sun. Space lower bounds for distance approximation in the data stream model. In Proceedings of the Symposium, on Theory of Computing, pages 360-369, 2002.
27. D. Woodruff. Optimal space lower bounds for all. frequency moments. Proceedings of the A CM-SIAM Symposium on Discrete Algorithms, pages 167-175, 2004.