Efficient communication protocols for deciding edit distance

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7501 LNCS, Issue , 2012, Pages 648-658

  Jowhari, Hossein ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CONCEPTUAL FRAMEWORKS; DOCUMENT EXCHANGE; EDIT DISTANCE; INPUT STRING; LOCALLY CONSISTENT PARSING; NON-TRIVIAL; RANDOMIZED PROTOCOLS; RUNNING TIME; THIRD PARTIES; TIME ALGORITHMS; TIME COMPLEXITY; UPPER BOUND;

ARTIFICIAL INTELLIGENCE;

ALGORITHMS;

EID: 84866724287     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33090-2_56     Document Type: Conference Paper

References (17)

1. Andoni, A., Krauthgamer, R.: The computational hardness of estimating edit distance [extended abstract]. In: FOCS, pp. 724-734 (2007)
2. Andoni, A., Krauthgamer, R., Onak, K.: Polylogarithmic approximation for edit distance and the asymmetric query complexity. In: FOCS, pp. 377-386 (2010)
3. Bar-Yossef, Z., Jayram, T.S., Krauthgamer, R., Kumar, R.: Approximating edit distance efficiently. In: FOCS, pp. 550-559 (2004)
4. Batu, T., Ergün, F., Kilian, J., Magen, A., Raskhodnikova, S., Rubinfeld, R., Sami, R.: A sublinear algorithm for weakly approximating edit distance. In: STOC, pp. 316-324 (2003)
5. Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. ACM Transactions on Algorithms 3(1) (2007)
6. Cormode, G., Paterson, M., Sahinalp, S.C., Vishkin, U.: Communication complexity of document exchange. In: SODA, pp. 197-206 (2000)
7. Gilbert, A., Indyk, P.: Sparse recovery using sparse matrices. Proceedings of IEEE (2010)
8. Gopalan, P., Jayram, T.S., Krauthgamer, R., Kumar, R.: Estimating the sortedness of a data stream. In: SODA, pp. 318-327 (2007)
9. Irmak, U., Mihaylov, S., Suel, T.: Improved single-round protocols for remote file synchronization. In: INFOCOM, pp. 1665-1676 (2005)
10. Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development 31(2), 249-260 (1987)
11. Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press (1997)
12. Landau, G.M., Myers, E.W., Schmidt, J.P.: Incremental string comparison. SIAM J. Comput. 27(2), 557-582 (1998)
13. Masek, W.J., Paterson, M.: A faster algorithm computing string edit distances. J. Comput. Syst. Sci. 20(1), 18-31 (1980)
14. Orlitsky, A.: Interactive communication: Balanced distributions, correlated files, and average-case complexity. In: FOCS, pp. 228-238 (1991)
15. Ostrovsky, R., Rabani, Y.: Low distortion embeddings for edit distance. J. ACM 54(5) (2007)
16. Porat, E., Lipsky, O.: Improved Sketching of Hamming Distance with Error Correcting. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 173-182. Springer, Heidelberg (2007)
17. Sun, X., Woodruff, D.P.: The communication and streaming complexity of computing the longest common and increasing subsequences. In: SODA, pp. 336-345 (2007)