{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T13:29:32Z","timestamp":1762954172956},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7868,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1992,1]]},"DOI":"10.1016\/0304-3975(92)90133-z","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"19-31","source":"Crossref","is-referenced-by-count":25,"title":["Average running time of the Boyer-Moore-Horspool algorithm"],"prefix":"10.1016","volume":"92","author":[{"given":"Ricardo A.","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":"78","reference":[{"issue":"3","key":"10.1016\/0304-3975(92)90133-Z_BIB1","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/spe.4380190305","article-title":"Improved string searching","volume":"19","author":"Baeza-Yates","year":"1989","journal-title":"Software-Practice and Experience"},{"key":"10.1016\/0304-3975(92)90133-Z_BIB2","series-title":"Ph.D. Thesis","article-title":"Efficient text searching","author":"Baeza-Yates","year":"1989"},{"key":"10.1016\/0304-3975(92)90133-Z_BIB3","series-title":"Workshop in Algorithms and Data Structures","first-page":"75","article-title":"String searching algorithms revisited","volume":"Vol. 382","author":"Baeza-Yates","year":"1989"},{"key":"10.1016\/0304-3975(92)90133-Z_BIB4","series-title":"Proc. 1st ACM-SIAM Symposium on Discrete Algorithms","first-page":"328","article-title":"Analysis of Boyer-Moore-type string searching algorithms","author":"Baeza-Yates","year":"1990"},{"key":"10.1016\/0304-3975(92)90133-Z_BIB5","first-page":"332","article-title":"Fast algorithms for two dimensional and multiple pattern matching","volume":"Vol. 447","author":"Baeza-Yates","year":"1990"},{"key":"10.1016\/0304-3975(92)90133-Z_BIB6","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0020-0190(84)90003-6","article-title":"An analytical comparison of two string searching algorithms","volume":"18","author":"Barth","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(92)90133-Z_BIB7","series-title":"Trends in Theoretical Computer Science","first-page":"225","article-title":"Mathematical methods in the analysis of algorithms and data structures","author":"Flajolet","year":"1988"},{"key":"10.1016\/0304-3975(92)90133-Z_BIB8","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1002\/spe.4380100608","article-title":"Practical fast searching in strings","volume":"10","author":"Horspool","year":"1980","journal-title":"Software-Practice and Experience"},{"key":"10.1016\/0304-3975(92)90133-Z_BIB9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90133-Z_BIB10","first-page":"431","article-title":"Knuth-Morris-Pratt algorithm: An analysis","volume":"Vol. 379","author":"Regnier","year":"1989"},{"key":"10.1016\/0304-3975(92)90133-Z_BIB11","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1137\/0206048","article-title":"On the worst-case behavior of string-searching algorithms","volume":"6","author":"Rivest","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90133-Z_BIB12","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1137\/0217041","article-title":"On the expected sublinearity of the Boyer-Moore algorithm","volume":"17","author":"Schaback","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"8","key":"10.1016\/0304-3975(92)90133-Z_BIB13","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1145\/79173.79184","article-title":"A very fast substring search algorithm","volume":"33","author":"Sunday","year":"1990","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(92)90133-Z_BIB14","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1137\/0208029","article-title":"The complexity of pattern matching for a random string","volume":"8","author":"Yao","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90133-Z_BIB15","volume":"Vol. 1","author":"Feller","year":"1968"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290133Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290133Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:56:39Z","timestamp":1555113399000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290133Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["030439759290133Z"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90133-z","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}