{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T21:20:22Z","timestamp":1776201622417,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540528463","type":"print"},{"value":"9783540471646","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52846-6_103","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:44:02Z","timestamp":1330206242000},"page":"348-359","source":"Crossref","is-referenced-by-count":10,"title":["Boyer-Moore approach to approximate string matching"],"prefix":"10.1007","author":[{"given":"Jorma","family":"Tarhio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esko","family":"Ukkonen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"31_CR1","unstructured":"R. Baeza-Yates: Efficient Text Searching. Ph.D. Thesis, Report CS-89-17, University of Waterloo, Computer Science Department, 1989."},{"key":"31_CR2","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/3-540-51542-9_9","volume-title":"Proceedings of the Workshop on Algorithms and Data Structures","author":"R. Baeza-Yates","year":"1989","unstructured":"R. Baeza-Yates: String searching algorithms revisited. In: Proceedings of the Workshop on Algorithms and Data Structures (ed. F. Dehne et al.), Lecture Notes in Computer Science 382, Springer-Verlag, Berlin, 1989, 75\u201396."},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R. Boyer","year":"1977","unstructured":"R. Boyer and S. Moore: A fast string searching algorithm. Communcations of the ACM 20 (1977), 762\u2013772.","journal-title":"Communcations of the ACM"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/8307.8309","volume":"17","author":"Z. Galil","year":"1986","unstructured":"Z. Galil and R. Giancarlo: Improved string matching with k mismatches. SIGACT News 17 (1986), 52\u201354.","journal-title":"SIGACT News"},{"key":"31_CR5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0885-064X(88)90008-8","volume":"4","author":"Z. Galil","year":"1988","unstructured":"Z. Galil and R. Giancarlo: Data structures and algorithms for approximate string matching. Journal of Complexity 4 (1988), 33\u201372.","journal-title":"Journal of Complexity"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1007\/BFb0035772","volume-title":"Proceedings of the 16th International Colloquium on Automata, Languages and Programming","author":"Z. Galil","year":"1989","unstructured":"Z. Galil and K. Park: An improved algorithm for approximate string matching. Proceedings of the 16th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 372, Springer-Verlag, Berlin, 1989, 394\u2013404."},{"key":"31_CR7","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 33 (1989), 113\u2013120.","journal-title":"Information Processing Letters"},{"key":"31_CR8","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1002\/spe.4380100608","volume":"10","author":"N. Horspool","year":"1980","unstructured":"N. Horspool: Practical fast searching in strings. Software Practice & Experience 10 (1980), 501\u2013506.","journal-title":"Software Practice & Experience"},{"key":"31_CR9","unstructured":"P. Jokinen, J. Tarhio and E. Ukkonen: A comparison of approximate string matching algorithms. In preparation."},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"S. R. Kosaraju: Efficient string matching. Extended abstract. Johns Hopkins University, 1988.","DOI":"10.1109\/SFCS.1989.63475"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. Knuth","year":"1977","unstructured":"D. Knuth, J. Morris and V. Pratt: Fast pattern matching in strings. SIAM Journal on Computing 6 (1977), 323\u2013350.","journal-title":"SIAM Journal on Computing"},{"key":"31_CR12","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 witk k differences. Journal of Computer and System Sciences 37 (1988), 63\u201378.","journal-title":"Journal of Computer and System Sciences"},{"key":"31_CR13","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"G. Landau","year":"1989","unstructured":"G. Landau and U. Vishkin: Fast parallel and serial approximate string matching. Journal of Algorithms 10 (1989), 157\u2013169.","journal-title":"Journal of Algorithms"},{"key":"31_CR14","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0196-6774(80)90016-4","volume":"1","author":"P. Sellers","year":"1980","unstructured":"P. Sellers: The theory and computation of evolutionary distances: Pattern recognition. Journal of Algorithms 1 (1980), 359\u2013372.","journal-title":"Journal of Algorithms"},{"key":"31_CR15","unstructured":"J. Tarhio and E. Ukkonen: Approximate Boyer-Moore string matching. Report A-1990-3. Department of Computer Science, University of Helsinki, 1990."},{"key":"31_CR16","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0019-9958(85)80046-2","volume":"64","author":"E. Ukkonen","year":"1985","unstructured":"E. Ukkonen: Algorithms for approximate string matching. Information Control 64 (1985), 100\u2013118.","journal-title":"Information Control"},{"key":"31_CR17","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 6 (1985), 132\u2013137.","journal-title":"Journal of Algorithms"},{"key":"31_CR18","unstructured":"E. Ukkonen and D. Wood: Fast approximate string matching with suffix automata. Manuscript, 1989."},{"key":"31_CR19","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R. Wagner","year":"1975","unstructured":"R. Wagner and M. Fischer: The string-to-string correction problem. Journal of the ACM 21 (1975), 168\u2013173.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","SWAT 90"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52846-6_103.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:09:28Z","timestamp":1619572168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52846-6_103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540528463","9783540471646"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-52846-6_103","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990]]}}}