{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:16Z","timestamp":1725663376317},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515425"},{"type":"electronic","value":"9783540482376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51542-9_9","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:08:04Z","timestamp":1330186084000},"page":"75-96","source":"Crossref","is-referenced-by-count":13,"title":["String searching algorithms revisited"],"prefix":"10.1007","author":[{"given":"Ricardo A.","family":"Baeza-Yates","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"issue":"6","key":"9_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":"9_CR2","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1137\/0215007","volume":"15","author":"A. Apostolico","year":"1986","unstructured":"A. Apostolico and R. Giancarlo. The Boyer-Moore-Galil string searching strategies revisited. SIAM J on Computing, 15:98\u2013105, 1986.","journal-title":"SIAM J on Computing"},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/B978-0-12-115350-2.50016-6","volume-title":"Formal Language Theory: Perspectives and Open Problems","author":"A. V. Aho","year":"1980","unstructured":"A.V. Aho. Pattern matching in strings. In R. Book, editor, Formal Language Theory: Perspectives and Open Problems, pages 325\u2013347. Academic Press, London, 1980."},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0020-0190(81)90042-9","volume":"13","author":"G. Barth","year":"1981","unstructured":"G. Barth. An alternative for the implementation of Knuth-Morris-Pratt algorithm. Inf. Proc. Letters, 13:134\u2013137, 1981.","journal-title":"Inf. Proc. Letters"},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0020-0190(84)90003-6","volume":"18","author":"G. Barth","year":"1984","unstructured":"G. Barth. An analytical comparison of two string searching algorithms. Inf. Proc. Letters, 18:249\u2013256, 1984.","journal-title":"Inf. Proc. Letters"},{"key":"9_CR6","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":"9_CR7","series-title":"Technical Report","volume-title":"On the average case of string matching algorithms","author":"R. Baeza-Yates","year":"1987","unstructured":"R. Baeza-Yates. On the average case of string matching algorithms. Technical Report CS-87-66, Department of Computer Science, University of Waterloo, Ontario, Canada, 1987."},{"issue":"3","key":"9_CR8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/spe.4380190305","volume":"19","author":"R. Baeza-Yates","year":"1989","unstructured":"R. Baeza-Yates. Improved string searching. Software-Practice and Experience, 19(3):257\u2013271, 1989.","journal-title":"Software-Practice and Experience"},{"doi-asserted-by":"crossref","unstructured":"R. Baeza-Yates and M. Regnier. Analysis of Boyer-Moore type string searching algorithms. (document in preparation), 1988.","key":"9_CR9","DOI":"10.1007\/3-540-51542-9_9"},{"key":"9_CR10","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1080\/00029890.1982.11995446","volume":"89","author":"A. Clausing","year":"1982","unstructured":"A. Clausing. Kantorovich-type inequalities. The American Mathematical Monthly, 89:314\u2013330, 1982.","journal-title":"The American Mathematical Monthly"},{"key":"9_CR11","volume-title":"The Theory of Stochastic Processes","author":"D. Cox","year":"1965","unstructured":"D. Cox and H. Miller. The Theory of Stochastic Processes. Chapman and Hall, London, 1965."},{"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.","key":"9_CR12","DOI":"10.1007\/3-540-09510-1_10"},{"key":"9_CR13","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1002\/spe.4380160608","volume":"16","author":"G. Davies","year":"1986","unstructured":"G. Davies and S. Bowsher. Algorithms for pattern matching. Software \u2014 Practice and Experience, 16:575\u2013601, 1986.","journal-title":"Software \u2014 Practice and Experience"},{"key":"9_CR14","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/359146.359148","volume":"22","author":"Z. Galil","year":"1979","unstructured":"Z. Galil. On improving the worst case running time of the Boyer-Moore string matching algorithm. C.ACM, 22:505\u2013508, 1979.","journal-title":"C.ACM"},{"key":"9_CR15","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1137\/0209051","volume":"9","author":"L. Guibas","year":"1980","unstructured":"L. Guibas and A. Odlyzko. A new proof of the linearity of the Boyer-Moore string searching algorithm. SIAM J on Computing, 9:672\u2013682, 1980.","journal-title":"SIAM J on Computing"},{"key":"9_CR16","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 \u2014 Practice and Experience, 10:501\u2013506, 1980.","journal-title":"Software \u2014 Practice and Experience"},{"key":"9_CR17","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":"9_CR18","volume-title":"The C Programming Language","author":"B. Kernighan","year":"1978","unstructured":"B. Kernighan and D. Ritchie. The C Programming Language. Prentice-Hall, Englewood Cliffs, NJ, 1978."},{"key":"9_CR19","volume-title":"Knuth-Morris-Pratt algorithm: An analysis","author":"M. Regnier","year":"1988","unstructured":"M. Regnier. Knuth-Morris-Pratt algorithm: An analysis. INRIA, Rocquencourt, France (unpublished), 1988."},{"key":"9_CR20","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1137\/0206048","volume":"6","author":"R. Rivest","year":"1977","unstructured":"R. Rivest. On the worst-case behavior of string-searching algorithms. SIAM J on Computing, 6:669\u2013674, 1977.","journal-title":"SIAM J on Computing"},{"key":"9_CR21","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":"9_CR22","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1137\/0217041","volume":"17","author":"R. Schaback","year":"1988","unstructured":"R. Schaback. On the expected sublinearity of the Boyer-Moore algorithm. SIAM J on Computing, 17:548\u2013658, 1988.","journal-title":"SIAM J on Computing"},{"key":"9_CR23","volume-title":"Algorithms","author":"R. Sedgewick","year":"1983","unstructured":"R. Sedgewick. Algorithms. Addison-Wesley, Reading, Mass., 1983."},{"key":"9_CR24","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/spe.4380120106","volume":"12","author":"G. V. Smit","year":"1982","unstructured":"G.V. Smit. A comparison of three string matching algorithms. Software \u2014 Practice and Experience, 12:57\u201366, 1982.","journal-title":"Software \u2014 Practice and Experience"},{"key":"9_CR25","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0020-0190(86)90075-X","volume":"22","author":"T. Takaoka","year":"1986","unstructured":"T. Takaoka. An on-line pattern matching algorithm. Inf. Proc. Letters, 22:329\u2013330, 1986.","journal-title":"Inf. Proc. Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51542-9_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:21:58Z","timestamp":1605630118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51542-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515425","9783540482376"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-51542-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}