{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T16:21:03Z","timestamp":1780330863922,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540603139","type":"print"},{"value":"9783540449133","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60313-1_153","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:16:22Z","timestamp":1330280182000},"page":"327-340","source":"Crossref","is-referenced-by-count":38,"title":["On using q-gram locations in approximate string matching"],"prefix":"10.1007","author":[{"given":"Erkki","family":"Sutinen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jorma","family":"Tarhio","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"10","key":"24_CR1","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R. Baeza-Yates","year":"1992","unstructured":"R. Baeza-Yates and G. Gonnet: A new approach to text searching. Communications of ACM\n35, 10 (1992), 74\u201382.","journal-title":"Communications of ACM"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF01185431","volume":"12","author":"W. Chang","year":"1994","unstructured":"W. Chang and E. Lawler: Sublinear approximate string matching and biological applications. Algorithmica\n12 (1994), 327\u2013344.","journal-title":"Algorithmica"},{"key":"24_CR3","first-page":"259","volume-title":"Lecture Notes in Computer Science 807","author":"W. Chang","year":"1994","unstructured":"W. Chang and T. Marr: Approximate string matching and local similarity. Combinatorial Pattern Matching, Proceedings of 5th Annual Symposium (ed. M. Crochemore and D. Gusfield), Lecture Notes in Computer Science\n807, Springer-Verlag, Berlin, 1994, 259\u2013273."},{"key":"24_CR4","first-page":"394","volume-title":"Lecture Notes in Computer Science 372","author":"Z. Galil","year":"1989","unstructured":"Z. Galil and K. Park: Art improved algorithm for approximate string matching. Proceedings of 16th International Colloquium on Automata, Languages and Programming (ed. M. Chytil et al.), Lecture Notes in Computer Science\n372, Springer-Verlag, Berlin, 1989, 394\u2013404."},{"key":"24_CR5","unstructured":"N. Holsti and E. Sutinen: Approximate string matching using q-gram places. Proc. Seventh Finnish Symposium on Computer Science (ed. M. Penttonen), University of Joensuu, 1994, 23\u201332."},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0020-0190(89)90188-9","volume":"33","author":"R. Grossi","year":"1989","unstructured":"R. Grossi and F. Luccio: Simple and efficient string matching with k mismatches. Information Processing Letters\n33 (1989), 113\u2013120.","journal-title":"Information Processing Letters"},{"key":"24_CR7","unstructured":"P. Jokinen, J. Tarhio, and E. Ukkonen: A comparison of approximate string matching algorithms. Report A-1991-7, Department of Computer Science, University of Helsinki, 1991."},{"key":"24_CR8","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"R. Karp","year":"1987","unstructured":"R. Karp and M. Rabin: Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development\n31 (1987), 249\u2013260.","journal-title":"IBM Journal of Research and Development"},{"key":"24_CR9","first-page":"197","volume-title":"Lecture Notes in Computer Science 684","author":"P. Pevzner","year":"1993","unstructured":"P. Pevzner and M. Waterman: A fast filtration algorithm for substring matching problem. Combinatorial Pattern Matching, Proceedings of 4th Annual Symposium (ed. A. Apostolico et al.), Lecture Notes in Computer Science 684, Springer-Verlag, Berlin, 1993, 197\u2013214."},{"key":"24_CR10","unstructured":"E. Sutinen and J. Tarhio: Information retrieval based on q-gram locations. In preparation."},{"key":"24_CR11","first-page":"234","volume-title":"Lecture Notes in Computer Science 834","author":"T. Takaoka","year":"1994","unstructured":"T. Takaoka: Approximate pattern matching with samples. Proceedings of ISAAC '94, Lecture Notes in Computer Science\n834, Springer-Verlag, Berlin, 1994, 234\u2013242."},{"issue":"2","key":"24_CR12","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1137\/0222018","volume":"22","author":"J. Tarhio","year":"1993","unstructured":"J. Tarhio and E. Ukkonen: Approximate Boyer-Moore string matching. SIAM Journal on Computing\n22, 2 (1993), 243\u2013260.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"24_CR13","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(92)90143-4","volume":"92","author":"E. Ukkonen","year":"1992","unstructured":"E. Ukkonen: Approximate string matching with q-grams and maximal matches. Theoretical Computer Science\n92, 1 (1992), 191\u2013211.","journal-title":"Theoretical Computer Science"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/0196-6774(85)90023-9","volume":"6","author":"E. Ukkonen","year":"1985","unstructured":"E. Ukkonen: Finding approximate patterns in strings. Journal of Algorithms\n6 (1985), 132\u2013137.","journal-title":"Journal of Algorithms"},{"issue":"10","key":"24_CR15","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S. Wu","year":"1992","unstructured":"S. Wu and U. Manber: Fast text searching allowing errors. Communications of ACM\n35, 10 (1992), 83\u201391.","journal-title":"Communications of ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60313-1_153.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:37:05Z","timestamp":1619573825000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60313-1_153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603139","9783540449133"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-60313-1_153","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}