{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T22:25:15Z","timestamp":1743459915038},"reference-count":12,"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)90139-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"119-144","source":"Crossref","is-referenced-by-count":28,"title":["A variation on the Boyer-Moore algorithm"],"prefix":"10.1016","volume":"92","author":[{"given":"Thierry","family":"Lecroq","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90139-7_BIB1","series-title":"Handbook of Theoretical Computer Science, Vol. A, Algorithms and Complexity","first-page":"255","article-title":"Algorithms for finding patterns in strings","author":"Aho","year":"1990"},{"key":"10.1016\/0304-3975(92)90139-7_BIB2","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1137\/0215007","article-title":"The Boyer-Moore-Galil string searching strategies revisited","volume":"15","author":"Apostolico","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90139-7_BIB3","series-title":"Boyer-Moore automata","author":"Baeza-Yates","year":"1989"},{"key":"10.1016\/0304-3975(92)90139-7_BIB4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","article-title":"The smallest automaton recognizing the subwords of a text","volume":"40","author":"Blumer","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90139-7_BIB5","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/359842.359859","article-title":"A fast string searching algorithm","volume":"20","author":"Boyer","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(92)90139-7_BIB6","first-page":"217","article-title":"An optimal algorithm for building the Boyer-Moore automaton","volume":"40","author":"Choffrut","year":"1990","journal-title":"EATCS Bull."},{"key":"10.1016\/0304-3975(92)90139-7_BIB7","unstructured":"R. Cole, Tight bounds on the complexity of the Boyer-Moore pattern matching algorithm, to appear."},{"key":"10.1016\/0304-3975(92)90139-7_BIB8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(86)90041-1","article-title":"Transducers and repetitions","volume":"45","author":"Crochemore","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90139-7_BIB9","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/359146.359148","article-title":"On improving the worst-case running time of the Boyer-Moore string-matching algorithm","volume":"22","author":"Galil","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(92)90139-7_BIB10","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1137\/0209051","article-title":"A new proof of the linearity of the Boyer-Moore string searching algorithm","volume":"9","author":"Guibas","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90139-7_BIB11","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)90139-7_BIB12","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1137\/0209037","article-title":"A correct preprocessing algorithm for Boyer-Moore string-searching","volume":"9","author":"Rytter","year":"1980","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592901397?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592901397?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:56:32Z","timestamp":1555127792000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397592901397"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["0304397592901397"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90139-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}