{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:26Z","timestamp":1725664226205},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540612582"},{"type":"electronic","value":"9783540683902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61258-0_4","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:21:33Z","timestamp":1330291293000},"page":"50-63","source":"Crossref","is-referenced-by-count":32,"title":["Filtration with q-samples in approximate string matching"],"prefix":"10.1007","author":[{"given":"Erkki","family":"Sutinen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorma","family":"Tarhio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"4_CR1","first-page":"487","volume":"194","author":"V. Arlazarov","year":"1970","unstructured":"V. Arlazarov, E. Dinic, M. Kronrod, and I. Faradzev: On economical construction of the transitive closure of a directed graph. Dokl. Akad. Nauk SSSR\n194 (1970), 487\u2013488 (in Russian). English translation in Soviet Math. Dokl.\n11 5, 1209\u20131210.","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"10","key":"4_CR2","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":"4_CR3","unstructured":"R. Baeza-Yates, G. Gonnet, and M. R\u00e9gnier: Analysis of Boyer-Moore-type string searching algorithms. In: Proc. First ACM-SIAM Symposium on Discrete Algorithms, 1990, 328\u2013343."},{"issue":"4\u20135","key":"4_CR4","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, 4\u20135 (1994), 327\u2013344.","journal-title":"Algorithmica"},{"key":"4_CR5","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. In: 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":"4_CR6","first-page":"41","volume-title":"Lecture Notes in Computer Science 937","author":"A. Cobbs","year":"1995","unstructured":"A. Cobbs: Fast approximate matching using suffix trees. In: Combinatorial Pattern Matching, Proceedings of 5th Annual Symposium (ed. Z. Galil and E. Ukkonen), Lecture Notes in Computer Science\n937, Springer, Berlin, 1995, 41\u201354."},{"key":"4_CR7","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":"4_CR8","doi-asserted-by":"crossref","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":"4_CR9","unstructured":"P. Jokinen, J. Tarhio, and E. Ukkonen: A comparison of approximate string matching algorithms. To appear in Software \u2014 Practice and Experience."},{"key":"4_CR10","first-page":"240","volume-title":"Lecture Notes in Computer Science 520","author":"P. Jokinen","year":"1991","unstructured":"P. Jokinen and E. Ukkonen: Two algorithms for approximate string matching in static texts. In: Proceedings of Mathematical Foundations of Computer Science 1991 (ed. A. Tarlecki), Lecture Notes in Computer Science 520, Springer-Verlag, Berlin, 1991, 240\u2013248."},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0000(88)90045-1","volume":"37","author":"G. Landau","year":"1988","unstructured":"G. Landau and U. Vishkin: Fast string matching with k differences. Journal of Computer and System Sciences\n37 (1988), 63\u201378.","journal-title":"Journal of Computer and System Sciences"},{"issue":"4\u20135","key":"4_CR12","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF01185432","volume":"12","author":"E. Myers","year":"1994","unstructured":"E. Myers: A sublinear algorithm for approximate keyword searching. Algorithmica\n12, 4\u20135 (1994), 345\u2013374.","journal-title":"Algorithmica"},{"key":"4_CR13","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF01188584","volume":"13","author":"P. Pevzner","year":"1995","unstructured":"P. Pevzner and M. Waterman: Multiple filtration and approximate pattern matching. Algorithmica\n13 (1995), 135\u2013154.","journal-title":"Algorithmica"},{"key":"4_CR14","first-page":"327","volume-title":"Lecture Notes in Computer Science 979","author":"E. Sutinen","year":"1995","unstructured":"E. Sutinen and J. Tarhio: On using q-gram locations in approximate string matching. In: Proc. 3rd Annual European Symposium on Algorithms ESA '95 (ed. P. Spirakis), Lecture Notes in Computer Science\n979, Springer, Berlin, 1995, 327\u2013340."},{"key":"4_CR15","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":"4_CR16","doi-asserted-by":"crossref","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"},{"key":"4_CR17","first-page":"228","volume-title":"Lecture Notes in Computer Science 684","author":"E. Ukkonen","year":"1993","unstructured":"E. Ukkonen: Approximate string-matching over suffix trees. In: Combinatorial Pattern Matching, Proceedings of 4th Annual Symposium (ed. A. Apostolico et al.), Lecture Notes in Computer Science\n684, Springer-Verlag, Berlin, 1993, 228\u2013243."},{"issue":"1","key":"4_CR18","doi-asserted-by":"crossref","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":"4_CR19","doi-asserted-by":"crossref","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"},{"key":"4_CR20","volume-title":"Managing Gigabytes","author":"I. Witten","year":"1994","unstructured":"I. Witten, A. Moffat, and T. Bell: Managing Gigabytes, Van Nostrand Reinhold, New York, 1994."},{"key":"4_CR21","unstructured":"S. Wu: Approximate pattern matching and its applications. Ph.D. Thesis, Report TR 92-21, Department of Computer Science, University of Arizona, 1992."},{"issue":"10","key":"4_CR22","doi-asserted-by":"crossref","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","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61258-0_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:30:09Z","timestamp":1619573409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61258-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540612582","9783540683902"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-61258-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}