{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:53:32Z","timestamp":1742972012578,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319199283"},{"type":"electronic","value":"9783319199290"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19929-0_10","type":"book-chapter","created":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T13:09:49Z","timestamp":1434373789000},"page":"114-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast String Dictionary Lookup with One Error"],"prefix":"10.1007","author":[{"given":"Timothy","family":"Chan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe","family":"Lewenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,16]]},"reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1006\/jagm.2000.1104","volume":"37","author":"A Amir","year":"2000","unstructured":"Amir, A., Keselman, D., Landau, G.M., Lewenstein, M., Lewenstein, N., Rodeh, M.: Text indexing and dictionary matching with one error. J. Algorithms 37(2), 309\u2013325 (2000)","journal-title":"J. Algorithms"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/978-3-319-07566-2_2","volume-title":"Combinatorial Pattern Matching","author":"A Amir","year":"2014","unstructured":"Amir, A., Levy, A., Porat, E., Shalom, B.R.: Dictionary matching with one gap. In: Kulikov, A.S., Kuznetsov, S.O., Pevzner, P. (eds.) CPM 2014. LNCS, vol. 8486, pp. 11\u201320. Springer, Heidelberg (2014)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-02441-2_14","volume-title":"Combinatorial Pattern Matching","author":"D Belazzougui","year":"2009","unstructured":"Belazzougui, D.: Faster and space-optimal edit distance \u201c1\u201d dictionary. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009 Lille. LNCS, vol. 5577, pp. 154\u2013167. Springer, Heidelberg (2009)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-31265-6_23","volume-title":"Combinatorial Pattern Matching","author":"D Belazzougui","year":"2012","unstructured":"Belazzougui, D., Venturini, R.: Compressed string dictionary look-up with edit distance one. In: K\u00e4rkk\u00e4inen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol. 7354, pp. 280\u2013292. Springer, Heidelberg (2012)"},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00224-013-9498-4","volume":"55","author":"P Bille","year":"2014","unstructured":"Bille, P., G\u00f8rtz, I.L., Vildh\u00f8j, H.W., Vind, S.: String indexing for patterns with wildcards. Theory Comput. Syst. 55(1), 41\u201360 (2014)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"10_CR6","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s00453-011-9499-0","volume":"63","author":"GS Brodal","year":"2012","unstructured":"Brodal, G.S., Davoodi, P., Rao, S.S.: On space efficient two dimensional range minimum data structures. Algorithmica 63(4), 815\u2013830 (2012)","journal-title":"Algorithmica"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/3-540-61258-0_6","volume-title":"Combinatorial Pattern Matching","author":"GS Brodal","year":"1996","unstructured":"Brodal, G.S., Gasieniec, L.: Approximate dictionary queries. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol. 1075, pp. 65\u201374. Springer, Heidelberg (1996)"},{"issue":"1\u20132","key":"10_CR8","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0020-0190(00)00079-X","volume":"75","author":"GS Brodal","year":"2000","unstructured":"Brodal, G.S., Venkatesh, S.: Improved bounds for dictionary look-up with one error. Inf. Process. Lett. 75(1\u20132), 57\u201359 (2000)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00453-008-9263-2","volume":"58","author":"H Chan","year":"2010","unstructured":"Chan, H., Lam, T.W., Sung, W., Tam, S., Wong, S.: Compressed indexes for approximate string matching. Algorithmica 58(2), 263\u2013281 (2010)","journal-title":"Algorithmica"},{"issue":"4","key":"10_CR10","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.jda.2011.04.004","volume":"9","author":"H-L Chan","year":"2011","unstructured":"Chan, H.-L., Lam, T.-W., Sung, W.-K., Tam, S.-L., Wong, S.-S.: A linear size index for approximate pattern matching. J. Discrete Algorithms 9(4), 358\u2013364 (2011)","journal-title":"J. Discrete Algorithms"},{"key":"10_CR11","unstructured":"Chan, T.M., Larsen, K.G., P\u01cetra\u015fcu, M.: Orthogonal range searching on the RAM, revisited. In: Proceedings of the 27th ACM Symposium on Computational Geometry, Paris, France, June 13\u201315, 2011, pp. 1\u201310 (2011)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Cole, R., Gottlieb, L.-A., Lewenstein, M.: Dictionary matching and indexing with errors and don\u2019t cares. In: Proceedings of Symposium on Theory of Computing (STOC), pp. 91\u2013100 (2004)","DOI":"10.1145\/1007352.1007374"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S0196-6774(03)00043-9","volume":"48","author":"ED Demaine","year":"2003","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A.: A linear lower bound on index size for text retrieval. J. Algorithms 48(1), 2\u201315 (2003)","journal-title":"J. Algorithms"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Muthukrishnan, S., de Berg, M.: Multi-method dispatching: a geometric approach with applications to string matching problems. In: Proceedings of Symposium on Theory of Computing (STOC), pp. 483\u2013491 (1999)","DOI":"10.1145\/301250.301378"},{"issue":"1","key":"10_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2006.12.012","volume":"372","author":"P Ferragina","year":"2007","unstructured":"Ferragina, P., Venturini, R.: A simple storage scheme for strings achieving entropy bounds. Theor. Comput. Sci. 372(1), 115\u2013121 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Hon, W.-K., Ku, T.-H., Shah, R., Thankachan, S.V., Vitter, J.S.: Compressed dictionary matching with one error. In: Data Compression Conference (DCC), pp.13\u2013122 (2011)","DOI":"10.1109\/DCC.2011.18"},{"issue":"3","key":"10_CR17","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/s00453-007-9104-8","volume":"51","author":"T-W Lam","year":"2008","unstructured":"Lam, T.-W., Sung, W.-K., Wong, S.-S.: Improved approximate string matching using compressed suffix data structures. Algorithmica 51(3), 298\u2013314 (2008)","journal-title":"Algorithmica"},{"key":"10_CR18","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Sov. Phys. Doklady 10, 707\u2013710 (1966)","journal-title":"Sov. Phys. Doklady"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-40273-9_18","volume-title":"Space-Efficient Data Structures, Streams, and Algorithms","author":"M Lewenstein","year":"2013","unstructured":"Lewenstein, M.: Orthogonal range searching for text indexing. In: Brodnik, A., L\u00f3pez-Ortiz, A., Raman, V., Viola, A. (eds.) Ianfest-66. LNCS, vol. 8066, pp. 267\u2013302. Springer, Heidelberg (2013)"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/978-3-662-44465-8_45","volume-title":"Mathematical Foundations of Computer Science 2014","author":"M Lewenstein","year":"2014","unstructured":"Lewenstein, M., Munro, J.I., Nekrich, Y., Thankachan, S.V.: Document retrieval with one wildcard. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part II. LNCS, vol. 8635, pp. 529\u2013540. Springer, Heidelberg (2014)"},{"key":"10_CR21","unstructured":"Lewenstein, M., Nekrich, Y., Vitter, J.S.: Space-efficient string indexing for wildcard pattern matching. In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), pp. 506\u2013517 (2014)"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-3-319-13075-0_13","volume-title":"Algorithms and Computation","author":"A Policriti","year":"2014","unstructured":"Policriti, A., Prezza, N.: Hashing and indexing: succinct data structures and smoothed analysis. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 157\u2013168. Springer, Heidelberg (2014)"},{"issue":"4","key":"10_CR23","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.jda.2010.08.002","volume":"8","author":"D Tsur","year":"2010","unstructured":"Tsur, D.: Fast index for approximate string matching. J. Discrete Algorithms 8(4), 339\u2013345 (2010)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"10_CR24","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1006\/jagm.1997.0875","volume":"25","author":"AC Yao","year":"1997","unstructured":"Yao, A.C., Yao, F.F.: Dictionary look-up with one error. J. Algorithms 25(1), 194\u2013202 (1997)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19929-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:30:26Z","timestamp":1676943026000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19929-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319199283","9783319199290"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19929-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}