{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:28:19Z","timestamp":1787340499411,"version":"build-2736575974"},"reference-count":8,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1986,2]]},"abstract":"<jats:p>Based on the Boyer\u2013Moore\u2013Galil approach, a new algorithm is proposed which requires a number of character comparisons bounded by 2n, regardless of the number of occurrences of the pattern in the textstring. Preprocessing is only slightly more involved and still requires a time linear in the pattern size.<\/jats:p>","DOI":"10.1137\/0215007","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:28:10Z","timestamp":1109226490000},"page":"98-105","source":"Crossref","is-referenced-by-count":100,"title":["The Boyer\u2013Moore\u2013Galil String Searching Strategies Revisited"],"prefix":"10.1137","volume":"15","author":[{"given":"Alberto","family":"Apostolico","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Raffaele","family":"Giancarlo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,8,2]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360855"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1145\/359842.359859"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1145\/359146.359148"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90002-8"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"Leo J. Guibas, Andrew M. Odlyzko,  A new proof of the linearity of the Boyer-Moore string searching algorithm,  18th Annual Symposium on Foundations of Computer Science (Providence, R.I., 1977), IEEE Comput. Sci., Long Beach, Calif.,  1977,  189\u2013195 58:8468","DOI":"10.1109\/SFCS.1977.3"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1137\/0206024"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1137\/0209037"},{"key":"R8","unstructured":"A. C. C. Yao,  The complexity of pattern matching for a random string, Technical Report, Computer Science Dept., Stanford Univ., Stanford, CA,  1977"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0215007","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:37:28Z","timestamp":1787337448000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0215007"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,2]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,2]]}},"alternative-id":["10.1137\/0215007"],"URL":"https:\/\/doi.org\/10.1137\/0215007","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,2]]}}}