{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:19:25Z","timestamp":1725567565653},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163661"},{"type":"electronic","value":"9783642163678"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16367-8_16","type":"book-chapter","created":{"date-parts":[[2010,10,7]],"date-time":"2010-10-07T11:25:55Z","timestamp":1286450755000},"page":"244-252","source":"Crossref","is-referenced-by-count":1,"title":["Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity"],"prefix":"10.1007","author":[{"given":"Alexandr","family":"Andoni","sequence":"first","affiliation":[]},{"given":"Robert","family":"Krauthgamer","sequence":"additional","affiliation":[]},{"given":"Krzysztof","family":"Onak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"#cr-split#-16_CR1.1","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals (in russian). Doklady Akademii Nauk SSSR\u00a04(163), 845\u2013848 (1965);"},{"key":"#cr-split#-16_CR1.2","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady 10(8), 707\u2013710 (1966) (Appeared in English)"},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Comput. Surv.\u00a033(1), 31\u201388 (2001)","journal-title":"ACM Comput. Surv."},{"key":"16_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees, and sequences. Cambridge University Press, Cambridge (1997)"},{"issue":"1","key":"16_CR4","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. Journal of the ACM\u00a021(1), 168\u2013173 (1974)","journal-title":"Journal of the ACM"},{"key":"16_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"W.J. Masek","year":"1980","unstructured":"Masek, W.J., Paterson, M.: A faster algorithm computing string edit distances. J. Comput. Syst. Sci.\u00a020(1), 18\u201331 (1980)","journal-title":"J. Comput. Syst. Sci."},{"issue":"28","key":"16_CR7","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1016\/j.tcs.2008.08.042","volume":"409","author":"P. Bille","year":"2008","unstructured":"Bille, P., Farach-Colton, M.: Fast and compact regular expression matching. Theoretical Computer Science\u00a0409(28), 486\u2013496 (2008)","journal-title":"Theoretical Computer Science"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Algorithmic aspects of geometric embeddings (tutorial). In: Proceedings of the Symposium on Foundations of Computer Science (FOCS), pp. 10\u201333 (2001)","DOI":"10.1109\/SFCS.2001.959878"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Indyk, P., Matou\u0161ek, J.: Low distortion embeddings of finite metric spaces. In: CRC Handbook of Discrete and Computational Geometry (2003)","DOI":"10.1201\/9781420035315.ch8"},{"key":"16_CR10","volume-title":"Encyclopedia of Algorithms","author":"S.C. Sahinalp","year":"2008","unstructured":"Sahinalp, S.C.: Edit distance under block operations. In: Kao, M.Y. (ed.) Encyclopedia of Algorithms. Springer, Heidelberg (2008)"},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1137\/S0097539794264810","volume":"27","author":"G.M. Landau","year":"1998","unstructured":"Landau, G.M., Myers, E.W., Schmidt, J.P.: Incremental string comparison. SIAM J. Comput.\u00a027(2), 557\u2013582 (1998)","journal-title":"SIAM J. Comput."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Bar-Yossef, Z., Jayram, T.S., Krauthgamer, R., Kumar, R.: Approximating edit distance efficiently. In: Proceedings of the Symposium on Foundations of Computer Science (FOCS), pp. 550\u2013559 (2004)","DOI":"10.1109\/FOCS.2004.14"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Batu, T., Erg\u00fcn, F., Sahinalp, C.: Oblivious string embeddings and edit distance approximations. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 792\u2013801 (2006)","DOI":"10.1145\/1109557.1109644"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Andoni, A., Onak, K.: Approximating edit distance in near-linear time. In: Proceedings of the Symposium on Theory of Computing (STOC), pp. 199\u2013204 (2009)","DOI":"10.1145\/1536414.1536444"},{"key":"#cr-split#-16_CR15.1","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Rabani, Y.: Low distortion embedding for edit distance. J. ACM\u00a054(5) (2007);","DOI":"10.1145\/1284320.1284322"},{"key":"#cr-split#-16_CR15.2","unstructured":"Preliminary version appeared in STOC 2005"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Batu, T., Erg\u00fcn, F., Kilian, J., Magen, A., Raskhodnikova, S., Rubinfeld, R., Sami, R.: A sublinear algorithm for weakly approximating edit distance. In: Proceedings of the Symposium on Theory of Computing (STOC), pp. 316\u2013324 (2003)","DOI":"10.1145\/780542.780590"},{"key":"16_CR17","unstructured":"Cormode, G., Paterson, M., Sahinalp, S.C., Vishkin, U.: Communication complexity of document exchange. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 197\u2013206 (2000)"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S., Sahinalp, C.: Approximate nearest neighbors and sequence comparison with block operations. In: Proceedings of the Symposium on Theory of Computing (STOC), pp. 416\u2013424 (2000)","DOI":"10.1145\/335305.335353"},{"key":"#cr-split#-16_CR19.1","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. ACM Trans. Algorithms\u00a03(1) (2007);","DOI":"10.1145\/1186810.1186812"},{"key":"#cr-split#-16_CR19.2","unstructured":"Special issue on SODA 2002"},{"key":"16_CR20","unstructured":"Cormode, G.: Sequence Distance Embeddings. Ph.D. Thesis, University of Warwick (2003)"},{"issue":"4","key":"16_CR21","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1007\/s00208-005-0745-0","volume":"334","author":"S. Khot","year":"2006","unstructured":"Khot, S., Naor, A.: Nonembeddability theorems via Fourier analysis. Math. Ann.\u00a0334(4), 821\u2013852 (2006); Preliminary version appeared in FOCS 2005","journal-title":"Math. Ann."},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Krauthgamer, R., Rabani, Y.: Improved lower bounds for embeddings into L 1. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1010\u20131017 (2006)","DOI":"10.1145\/1109557.1109669"},{"issue":"6","key":"16_CR23","doi-asserted-by":"publisher","first-page":"2398","DOI":"10.1137\/080716530","volume":"39","author":"A. Andoni","year":"2010","unstructured":"Andoni, A., Krauthgamer, R.: The computational hardness of estimating edit distance. SIAM Journal on Computing\u00a039(6), 2398\u20132429 (2010); Previously appeared in FOCS 2007","journal-title":"SIAM Journal on Computing"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Andoni, A., Jayram, T., P\u01cetra\u015fcu, M.: Lower bounds for edit distance and product metrics via Poincar\u00e9-type inequalities. Accepted to ACM-SIAM Symposium on Discrete Algorithms (SODA 2010) (2010)","DOI":"10.1137\/1.9781611973075.17"},{"key":"16_CR25","unstructured":"Andoni, A., Nguyen, H.L.: Near-tight bounds for testing Ulam distance. Accepted to ACM-SIAM Symposium on Discrete Algorithms (SODA 2010) (2010)"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Saks, M., Sun, X.: Space lower bounds for distance approximation in the data stream model. In: Proceedings of the Symposium on Theory of Computing (STOC), pp. 360\u2013369 (2002)","DOI":"10.1145\/509907.509963"},{"key":"16_CR27","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1002\/rsa.20167","volume":"31","author":"N. Ailon","year":"2007","unstructured":"Ailon, N., Chazelle, B., Comandur, S., Liu, D.: Estimating the distance to a monotone function. Random Structures and Algorithms\u00a031, 371\u2013383 (2007); Previously appeared in RANDOM 2004","journal-title":"Random Structures and Algorithms"},{"issue":"3","key":"16_CR28","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1006\/jcss.1999.1692","volume":"60","author":"F. Erg\u00fcn","year":"2000","unstructured":"Erg\u00fcn, F., Kannan, S., Kumar, R., Rubinfeld, R., Viswanathan, M.: Spot-checkers. J. Comput. Syst. Sci.\u00a060(3), 717\u2013751 (2000)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"16_CR29","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1137\/S0097539798347177","volume":"30","author":"E. Kushilevitz","year":"2000","unstructured":"Kushilevitz, E., Ostrovsky, R., Rabani, Y.: Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM J. Comput.\u00a030(2), 457\u2013474 (2000); Preliminary version appeared in STOC 1998","journal-title":"SIAM J. Comput."},{"key":"16_CR30","doi-asserted-by":"crossref","unstructured":"Indyk, P., Woodruff, D.: Optimal approximations of the frequency moments of data streams. In: Proceedings of the Symposium on Theory of Computing (STOC) (2005)","DOI":"10.1145\/1060590.1060621"}],"container-title":["Lecture Notes in Computer Science","Property Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16367-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T05:10:54Z","timestamp":1559711454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16367-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163661","9783642163678"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16367-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}