Polylogarithmic approximation for edit distance and the asymmetric query complexity

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

Volumn , Issue , 2010, Pages 377-386

  Andoni, Alexandr ^a   Krauthgamer, Robert ^b   Onak, Krzysztof ^c  

^a PRINCETON UNIVERSITY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Edit distance; Linear time algorithms; Query complexity; Sampling; Sublinear algorithms

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATIONAL COMPLEXITY; SAMPLING;

APPROXIMATION FACTOR; EDIT DISTANCE; LINEAR-TIME ALGORITHMS; NEAR-LINEAR TIME; POLY-LOGARITHMIC FACTORS; POLYLOGARITHMIC APPROXIMATION; QUERY COMPLEXITY; SUBLINEAR ALGORITHM;

APPROXIMATION ALGORITHMS;

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

References (34)

1. N. Ailon, B. Chazelle, S. Comandur, and D. Liu, "Estimating the distance to a monotone function," Random Structures and Algorithms, vol. 31, pp. 371-383, 2007, previously appeared in RANDOM'04.
2. A. Andoni, T. Jayram, and M. Pǎtraşcu, "Lower bounds for edit distance and product metrics via Poincaré-type inequalities," in Proc. of SODA, 2010.
3. A. Andoni and R. Krauthgamer, "The smoothed complexity of edit distance," in Proc. of ICALP, 2008, pp. 357-369.
4. -, "The computational hardness of estimating edit distance," SIAM Journal on Computing, vol. 39, no. 6, pp. 2398-2429, 2010, previously appeared in FOCS'07.
5. A. Andoni, R. Krauthgamer, and K. Onak, "Streaming applications from precision sampling," 2010, manuscript.
6. A. Andoni and H. L. Nguyen, "Near-tight bounds for testing Ulam distance," in Proc. of SODA, 2010.
7. A. Andoni and K. Onak, "Approximating edit distance in near-linear time," in Proc. of STOC, 2009, pp. 199-204.
8. Z. Bar-Yossef, T. S. Jayram, R. Krauthgamer, and R. Kumar, "Approximating edit distance efficiently," in Proc. of FOCS, 2004, pp. 550-559.
9. 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 Proc. of STOC, 2003, pp. 316-324.
10. T. Batu, F. Ergün, and C. Sahinalp, "Oblivious string embeddings and edit distance approximations," in Proc. of SODA, 2006, pp. 792-801.
11. P. Bille and M. Farach-Colton, "Fast and compact regular expression matching," Theoretical Computer Science, vol. 409, no. 28, pp. 486-496, 2008.
12. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. MIT Press, 2001.
13. G. Cormode, Sequence Distance Embeddings, ser. Ph.D. Thesis, University of Warwick, 2003.
14. G. Cormode and S. Muthukrishnan, "The string edit distance matching problem with moves," ACM Trans. Algorithms, vol. 3, no. 1, 2007, special issue on SODA'02.
15. G. Cormode, M. Paterson, S. C. Sahinalp, and U. Vishkin, "Communication complexity of document exchange," in Proc. of SODA, 2000, pp. 197-206.
16. F. Ergün, S. Kannan, R. Kumar, R. Rubinfeld, and M. Viswanathan, "Spot-checkers," J. Comput. Syst. Sci., vol. 60(3), pp. 717-751, 2000.
17. D. Gusfield, Algorithms on strings, trees, and sequences. Cambridge: Cambridge University Press, 1997.
18. P. Indyk, "Algorithmic aspects of geometric embeddings (tutorial)," in Proc. of FOCS, 2001, pp. 10-33.
19. P. Indyk and J. Matoušek, "Low distortion embeddings of finite metric spaces," CRC Handbook of Discrete and Computational Geometry, 2003.
20. P. Indyk and D. Woodruff, "Optimal approximations of the frequency moments of data streams," Proc. of STOC, 2005.
21. S. Khot and A. Naor, "Nonembeddability theorems via Fourier analysis," Math. Ann., vol. 334, no. 4, pp. 821-852, 2006, preliminary version appeared in FOCS'05.
22. 1," in Proc. of SODA, 2006, pp. 1010-1017.
23. E. Kushilevitz, R. Ostrovsky, and Y. Rabani, "Efficient search for approximate nearest neighbor in high dimensional spaces," SIAM J. Comput., vol. 30, no. 2, pp. 457-474, 2000, preliminary version appeared in STOC'98.
24. G. M. Landau, E. W. Myers, and J. P. Schmidt, "Incremental string comparison," SIAM J. Comput., vol. 27, no. 2, pp. 557-582, 1998.
25. V. I. Levenshtein, "Binary codes capable of correcting deletions, insertions, and reversals (in russian)," Doklady Akademii Nauk SSSR, vol. 4, no. 163, pp. 845-848, 1965,
26. appeared in English as: V. I. Levenshtein, Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady 10(8), 707-710, 1966.
27. W. J. Masek and M. Paterson, "A faster algorithm computing string edit distances," J. Comput. Syst. Sci., vol. 20, no. 1, pp. 18-31, 1980.
28. J. Matoušek, "Collection of open problems on low-distortion embeddings of finite metric spaces," March 2007, available online. Last access in August, 2007.
29. S. Muthukrishnan and C. Sahinalp, "Approximate nearest neighbors and sequence comparison with block operations," Proc. of STOC, pp. 416-424, 2000.
30. G. Navarro, "A guided tour to approximate string matching," ACM Comput. Surv., vol. 33, no. 1, pp. 31-88, 2001.
31. R. Ostrovsky and Y. Rabani, "Low distortion embedding for edit distance," J. ACM, vol. 54, no. 5, 2007, preliminary version appeared in STOC'05.
32. S. C. Sahinalp, "Edit distance under block operations," in Encyclopedia of Algorithms, M.-Y. Kao, Ed. Springer, 2008.
33. M. Saks and X. Sun, "Space lower bounds for distance approximation in the data stream model," in Proc. of STOC, 2002.
34. R. A. Wagner and M. J. Fischer, "The string-to-string correction problem," J. ACM, vol. 21, no. 1, pp. 168-173, 1974.