{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:34:06Z","timestamp":1742963646359,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":19,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493928637"},{"type":"electronic","value":"9781493928644"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_188","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:23Z","timestamp":1461269003000},"page":"964-968","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Indexed Approximate String Matching"],"prefix":"10.1007","author":[{"given":"Wing-Kin","family":"Sung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"issue":"2","key":"190_CR969","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 GM, Lewenstein M, Lewenstein N, Rodeh M (2000) Indexing and dictionary matching with one error. J Algorithms, 37(2):309\u2013325","journal-title":"J Algorithms"},{"key":"190_CR970","doi-asserted-by":"crossref","unstructured":"Belazzougui D (2009) Faster and space-optimal edit distance \u201c1\u201d dictionary. In: Proceedings of the 20th annual symposium on combinatorial pattern matching (CPM), Lille, pp\u00a0154\u2013167","DOI":"10.1007\/978-3-642-02441-2_14"},{"key":"190_CR971","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-014-9873-9","author":"D Belazzougui","year":"2014","unstructured":"Belazzougui D (2014) Improved space-time tradeoffs for approximate full-text indexing with one edit error. Algorithmica. doi:10.1007\/s00453-014-9873-9","journal-title":"Algorithmica"},{"key":"190_CR972","first-page":"120","volume-title":"Range searching over tree cross products","author":"AL Buchsbaum","year":"2000","unstructured":"Buchsbaum AL, Goodrich MT, Westbrook JR (2000) Range searching over tree cross products. In: Proceedings of European symposium on algorithms, Saarbr\u00fccken, pp\u00a0120\u2013131"},{"issue":"4","key":"190_CR973","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 (2011) A linear size index for approximate pattern matching. J Discr Algorithms 9(4):358\u2013364","journal-title":"J Discr Algorithms"},{"issue":"2","key":"190_CR974","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00453-008-9263-2","volume":"58","author":"H-L Chan","year":"2010","unstructured":"Chan H-L, Lam T-W, Sung W-K, Tam S-L, Wong S-S (2010) Compressed indexes for approximate string matching. Algorithmica 58(2):263\u2013281","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"190_CR975","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.tcs.2005.11.037","volume":"352","author":"G Navarro","year":"2006","unstructured":"Navarro G, Ch\u00e1vez E (2006) A metric index for approximate string matching. Theor Comput Sci 352(1\u20133):266\u2013279","journal-title":"Theor Comput Sci"},{"key":"190_CR976","first-page":"41","volume-title":"Fast approximate matching using suffix trees","author":"A Cobbs","year":"1995","unstructured":"Cobbs A (1995) Fast approximate matching using suffix trees. In: Proceedings of symposium on combinatorial pattern matching, Espoo, pp\u00a041\u201354"},{"key":"190_CR977","first-page":"329","volume-title":"Dotted suffix trees: a structure for approximate text indexing","author":"LP Coelho","year":"2006","unstructured":"Coelho LP, Oliveira AL (2006) Dotted suffix trees: a structure for approximate text indexing. In: SPIRE, Glasgow, pp\u00a0329\u2013336"},{"key":"190_CR978","first-page":"91","volume-title":"Dictionary matching and indexing with errors and don\u2019t cares","author":"R Cole","year":"2004","unstructured":"Cole R, Gottlieb LA, Lewenstein M (2004) Dictionary matching and indexing with errors and don\u2019t cares. In: Proceedings of symposium on theory of computing, Chicago, pp\u00a091\u2013100"},{"issue":"1\u20133","key":"190_CR979","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.tcs.2007.06.006","volume":"385","author":"C Epifanio","year":"2007","unstructured":"Epifanio C, Gabriele A, Mignosi F, Restivo A, Sciortino M (2007) Languages with mismatches. Theor Comput Sci 385(1\u20133):152\u2013166","journal-title":"Theor Comput Sci"},{"key":"190_CR980","doi-asserted-by":"crossref","unstructured":"Gabriele A, Mignosi F, Restivo A, Sciortino M (2003) Indexing structures for approximate string matching. In: Proceedings of the 5th Italian conference on algorithms and complexity (CIAC), Rome, pp\u00a0140\u2013151","DOI":"10.1007\/3-540-44849-7_20"},{"issue":"1\u20133","key":"190_CR981","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.tcs.2005.11.022","volume":"352","author":"TND Huynh","year":"2006","unstructured":"Huynh TND, Hon WK, Lam TW, Sung WK (2006) Approximate string matching using compressed suffix arrays. Theor Comput Sci 352(1\u20133):240\u2013249","journal-title":"Theor Comput Sci"},{"issue":"3","key":"190_CR982","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/s00453-007-9104-8","volume":"51","author":"TW Lam","year":"2008","unstructured":"Lam TW, Sung WK, Wong SS (2008) Improved approximate string matching using compressed suffix data structures. Algorithmica 51(3): 298\u2013314","journal-title":"Algorithmica"},{"issue":"4","key":"190_CR983","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1016\/j.jda.2006.11.001","volume":"5","author":"MG Maa\u00df","year":"2007","unstructured":"Maa\u00df MG, Nowak J (2007) Text indexing with errors. J Discr Algorithms 5(4):662\u2013681","journal-title":"J Discr Algorithms"},{"key":"190_CR984","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF01185432","volume":"12","author":"EG Myers","year":"1994","unstructured":"Myers EG (1994) A sublinear algorithm for approximate keyword searching. Algorithmica 12: 345\u2013374","journal-title":"Algorithmica"},{"issue":"1","key":"190_CR985","first-page":"205","volume":"1","author":"G Navarro","year":"2000","unstructured":"Navarro G, Baeza-Yates R (2000) A hybrid indexing method for approximate string matching. J Discr Algorithms 1(1):205\u2013209","journal-title":"J Discr Algorithms"},{"issue":"4","key":"190_CR986","first-page":"19","volume":"24","author":"G Navarro","year":"2001","unstructured":"Navarro G, Baeza-Yates RA, Sutinen E, Tarhio J (2001) Indexing methods for approximate string matching. IEEE Data Eng Bull 24(4):19\u201327","journal-title":"IEEE Data Eng Bull"},{"issue":"4","key":"190_CR987","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 (2010) Fast index for approximate string matching. J Discr Algorithms 8(4):339\u2013345","journal-title":"J Discr Algorithms"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_188","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T17:42:27Z","timestamp":1553103747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_188","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}