{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T14:45:43Z","timestamp":1770475543133,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,13]],"date-time":"2004-06-13T00:00:00Z","timestamp":1087084800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,6,13]]},"DOI":"10.1145\/1007352.1007374","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"91-100","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":154,"title":["Dictionary matching and indexing with errors and don't cares"],"prefix":"10.1145","author":[{"given":"Richard","family":"Cole","sequence":"first","affiliation":[{"name":"New York University, NY, NY"}]},{"given":"Lee-Ad","family":"Gottlieb","sequence":"additional","affiliation":[{"name":"New York University, NY, NY"}]},{"given":"Moshe","family":"Lewenstein","sequence":"additional","affiliation":[{"name":"Bar-Ilan University, Ramat Gan, Israel"}]}],"member":"320","published-online":{"date-parts":[[2004,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216067"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360855"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00111-O"},{"key":"e_1_3_2_1_4_1","volume-title":"E79-D:1353--1354","author":"Akutsu T.","year":"1996","unstructured":"T. Akutsu . Approximate string matching with variable length don't care characters. IEICE Trans. Information and Systems , E79-D:1353--1354 , 1996 .]] T. Akutsu. Approximate string matching with variable length don't care characters. IEICE Trans. Information and Systems, E79-D:1353--1354, 1996.]]"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185445"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80047-9"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1090"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1104"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45078-8_30"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. of the Symposium on Discrete Algorithms","author":"Amir A.","year":"2000","unstructured":"A. Amir , M. Lewenstein and E. Porat . Faster algorithms for string matching with k mismatches . Proc. of the Symposium on Discrete Algorithms , 2000 , 794--803.]] A. Amir, M. Lewenstein and E. Porat. Faster algorithms for string matching with k mismatches. Proc. of the Symposium on Discrete Algorithms, 2000, 794--803.]]"},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. of the Symposium on Discrete Algorithms","author":"Amir A.","year":"2001","unstructured":"A. Amir , M. Lewenstein and E. Porat . Approximate subset matching with don't cares . Proc. of the Symposium on Discrete Algorithms , 2001 , 279--288.]] A. Amir, M. Lewenstein and E. Porat. Approximate subset matching with don't cares. Proc. of the Symposium on Discrete Algorithms, 2001, 279--288.]]"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/647815.738443"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00079-X"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/647910.740473"},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. of the Symposium on Discrete Algorithms","author":"Cole R.","year":"1998","unstructured":"R. Cole and R. Hariharan . Approximate string matching: A faster simpler algorithm . Proc. of the Symposium on Discrete Algorithms , 1998 , 463--472.]] R. Cole and R. Hariharan. Approximate string matching: A faster simpler algorithm. Proc. of the Symposium on Discrete Algorithms, 1998, 463--472.]]"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509992"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796326"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301378"},{"key":"e_1_3_2_1_19_1","first-page":"113","article-title":"String matching and other products. Complexity of Computation, R. M. Karp (editor)","volume":"7","author":"Fischer M. J.","year":"1974","unstructured":"M. J. Fischer and M. S. Paterson . String matching and other products. Complexity of Computation, R. M. Karp (editor) , SIAM-AMS Proceedings , 7 : 113 -- 125 , 1974 .]] M. J. Fischer and M. S. Paterson. String matching and other products. Complexity of Computation, R. M. Karp (editor), SIAM-AMS Proceedings, 7:113--125, 1974.]]","journal-title":"SIAM-AMS Proceedings"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/8307.8309"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365720"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335351"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1171"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/0213024"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/647812.760774"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798347177"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/11534.11541"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(89)90010-2"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00032-8"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321946"},{"key":"e_1_3_2_1_32_1","first-page":"177","volume-title":"Sorting and Searching","author":"Mehlhorn K.","year":"1984","unstructured":"K. Mehlhorn . Data Structures and Efficient Algorithms , Vol. 1 : Sorting and Searching , pp. 177 -- 178 . Springer Verlag , EATCS Monographs, 1984 .]] K. Mehlhorn. Data Structures and Efficient Algorithms, Vol. 1: Sorting and Searching, pp. 177--178. Springer Verlag, EATCS Monographs, 1984.]]"},{"key":"e_1_3_2_1_33_1","volume-title":"Perceptrons","author":"Minsky M.","year":"1969","unstructured":"M. Minsky and S. Papert . Perceptrons . MIT Press , Cambridge, Mass ., 1969 .]] M. Minsky and S. Papert. Perceptrons. MIT Press, Cambridge, Mass., 1969.]]"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875524"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217079"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.755614"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206331"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1973.13"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(83)90075-3"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0875"}],"event":{"name":"STOC04: Symposium of Theory of Computing 2004","location":"Chicago IL USA","acronym":"STOC04","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007374","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007352.1007374","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:23:55Z","timestamp":1750267435000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007374"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6,13]]},"references-count":40,"alternative-id":["10.1145\/1007352.1007374","10.1145\/1007352"],"URL":"https:\/\/doi.org\/10.1145\/1007352.1007374","relation":{},"subject":[],"published":{"date-parts":[[2004,6,13]]},"assertion":[{"value":"2004-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}