{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:22:19Z","timestamp":1725488539163},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401766"},{"type":"electronic","value":"9783540448495"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44849-7_20","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:26:17Z","timestamp":1186741577000},"page":"140-151","source":"Crossref","is-referenced-by-count":9,"title":["Indexing Structures for Approximate String Matching"],"prefix":"10.1007","author":[{"given":"Alessandra","family":"Gabriele","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filippo","family":"Mignosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Restivo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marinella","family":"Sciortino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"20_CR1","first-page":"181","volume":"1663","author":"A. Amir","year":"1999","unstructured":"A. Amir, D. Keselman, G. M. Landau, M. Lewenstein, N. Lewenstein, and M. Rodeh. Indexing and dictionary matching with one error. LLNCS, 1663:181\u2013190, 1999.","journal-title":"LLNCS"},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1214\/aoap\/1177005208","volume":"4","author":"R. Arratia","year":"1989","unstructured":"R. Arratia and M. Waterman. The erd\u2019os-r\u00e9nyi strong law for pattern matching with given proportion of mismatches. Annals of Probability, 4:200\u2013225, 1989.","journal-title":"Annals of Probability"},{"key":"20_CR3","unstructured":"R. B. Ash. Information Theory. Interscience, 1965."},{"key":"20_CR4","unstructured":"M. Crochemore, C. Hancart, and T. Lecroq. Algorithmique du texte. Vuibert, 2001. 347 pages."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"A. Gabriele, F. Mignosi, A. Restivo, and M. Sciortino. Indexing structure for approximate string matching. Technical Report 169, University of Palermo, Department of Mathematics and Applications, 2002.","DOI":"10.1007\/3-540-44849-7_20"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0885-064X(88)90008-8","volume":"24","author":"Z. Galil","year":"1988","unstructured":"Z. Galil and R. Giancarlo. Data structures and algorithms for approximate string matching. Journal of Complexity, 24:33\u201372, 1988.","journal-title":"Journal of Complexity"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997. ISBN 0 521 58519 8 hardback. 534 pages.","DOI":"10.1017\/CBO9780511574931"},{"key":"20_CR8","unstructured":"S. Muthukrishnan. Efficient algorithms for document retrieval problems. In Proceedings of the 13th Annual ACM-SIAM Sumposium on Discrete Algorithms, pages 657\u2013666, 2002."},{"issue":"1","key":"20_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31\u201388, 2001.","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"20_CR10","first-page":"19","volume":"24","author":"G. Navarro","year":"2001","unstructured":"G. Navarro, R. Baeza-Yates, E. Sutinen, and J. Tarhio. Indexing methods for approximate string matching. IEEE Data Engineering Bulletin, 24(4):19\u201327, 2001. Special issue on Managing Text Natively and in DBMSs. Invited paper.","journal-title":"IEEE Data Engineering Bulletin"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44849-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T19:02:50Z","timestamp":1684004570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44849-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401766","9783540448495"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44849-7_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}