{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:42Z","timestamp":1759637742031},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540528463"},{"type":"electronic","value":"9783540471646"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52846-6_102","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:43:54Z","timestamp":1330206234000},"page":"332-347","source":"Crossref","is-referenced-by-count":10,"title":["Fast algorithms for two dimensional and multiple pattern matching"],"prefix":"10.1007","author":[{"given":"Ricardo","family":"Baeza-Yates","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mireille","family":"R\u00e9gnier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"6","key":"30_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"A.V. Aho and M. Corasick. Efficient string matching: An aid to bibliographic search. C.ACM, 18(6):333\u2013340, June 1975.","journal-title":"C.ACM"},{"key":"30_CR2","unstructured":"A. Amir and M. Farach. The whole is faster than its parts: Efficient matching of non-rectangular shapes. Technical Report CS-TR-2256, Dept. of Computer Science, Univ. of Maryland, 1989."},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1137\/0207043","volume":"7","author":"T. Baker","year":"1978","unstructured":"T. Baker. A technique for extending rapid exact string matching to arrays of more than one dimension. SIAM J on Computing, 7:533\u2013541, 1978.","journal-title":"SIAM J on Computing"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/0020-0190(77)90017-5","volume":"6","author":"R. Bird","year":"1977","unstructured":"R. Bird. Two dimensional pattern matching. Inf. Proc. Letters, 6:168\u2013170, 1977.","journal-title":"Inf. Proc. Letters"},{"key":"30_CR5","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. C.ACM, 20:762\u2013772, 1977.","journal-title":"C.ACM"},{"key":"30_CR6","unstructured":"R.A. Baeza-Yates. Efficient Text Searching. PhD thesis, Dept. of Computer Science, University of Waterloo, May 1989. Also as Research Report CS-89-17."},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"R.A. Baeza-Yates. String searching algorithms revisited. In F. Dehne, J.-R. Sack, and N. Santoro, editors, Workshop in Algorithms and Data Structures, pages 75\u201396, Ottawa, Canada, August 1989. Springer Verlag Lecture Notes on Computer Science 382.","DOI":"10.1007\/3-540-51542-9_9"},{"key":"30_CR8","unstructured":"R. Baeza-Yates, G. Gonnet, and M. Regnier. Analysis of Boyer-Moore-type string searching algorithms. In 1st ACM-SIAM Symposium on Discrete Algorithms, pages 328\u2013343, San Francisco, January 1990."},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"B. Commentz-Walter. A string matching algorithm fast on the average. In ICALP, volume 6 of Lecture Notes in Computer Science, pages 118\u2013132. Springer-Verlag, 1979.","DOI":"10.1007\/3-540-09510-1_10"},{"key":"30_CR10","volume-title":"An Introduction to Probability Theory and Its Applications, volume 1","author":"W. Feller","year":"1968","unstructured":"W. Feller. An Introduction to Probability Theory and Its Applications, volume 1. John Wiley and Sons, New York, 1968."},{"key":"30_CR11","unstructured":"G.H. Gonnet. Efficient searching of text and pictures (extended abstract). Technical Report OED-88-02, Centre for the New OED., University of Waterloo, 1988."},{"key":"30_CR12","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1002\/spe.4380100608","volume":"10","author":"R. N. Horspool","year":"1980","unstructured":"R. N. Horspool. Practical fast searching in strings. Software \u2014 Practice and Experience, 10:501\u2013506, 1980.","journal-title":"Software \u2014 Practice and Experience"},{"key":"30_CR13","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"D.E. Knuth, J. Morris, and V. Pratt. Fast pattern matching in strings. SIAM J on Computing, 6:323\u2013350, 1977.","journal-title":"SIAM J on Computing"},{"key":"30_CR14","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 J Res. Development, 31:249\u2013260, 1987.","journal-title":"IBM J Res. Development"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"M. Regnier. Knuth-Morris-Pratt algorithm: An analysis. In MFCS'89, Lecture Notes in Computer Science 379, pages 431\u2013444, Porabka, Poland, August 1989. Springer-Verlag. Also as INRIA Report 966, 1989.","DOI":"10.1007\/3-540-51486-4_90"},{"key":"30_CR16","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1137\/0209037","volume":"9","author":"W. Rytter","year":"1980","unstructured":"W. Rytter. A correct preprocessing algorithm for Boyer-Moore string-searching. SIAM J on Computing, 9:509\u2013512, 1980.","journal-title":"SIAM J on Computing"},{"key":"30_CR17","unstructured":"R.K. Shyamasundar. A simple string matching algorithm. Technical report, Nat. Centre for Software Development and Computing Techniques, Tata Institute of Fundamental Research, Bombay, India, 1976."},{"key":"30_CR18","unstructured":"M.A. Sridhar. Efficient algorithms for multiple pattern matching. Technical Report Computer Sciences 661, University of Wisconsin-Madison, 1986."},{"key":"30_CR19","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1137\/0208029","volume":"8","author":"A.C. Yao","year":"1979","unstructured":"A.C. Yao. The complexity of pattern matching for a random string. SIAM J on Computing, 8:368\u2013387, 1979.","journal-title":"SIAM J on Computing"},{"issue":"9","key":"30_CR20","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1145\/66451.66459","volume":"32","author":"R.F. Zhu","year":"1989","unstructured":"R.F. Zhu and T. Takaoka. A technique for two-dimensional pattern matching. Communications of the ACM, 32(9):1110\u20131120, September 1989.","journal-title":"Communications 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_102.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:25:16Z","timestamp":1605648316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52846-6_102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540528463","9783540471646"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-52846-6_102","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}