{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T04:50:26Z","timestamp":1698382226032},"reference-count":2,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1980,8]]},"DOI":"10.1137\/0209037","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T11:21:58Z","timestamp":1109244118000},"page":"509-512","source":"Crossref","is-referenced-by-count":35,"title":["A Correct Preprocessing Algorithm for Boyer\u2013Moore String-Searching"],"prefix":"10.1137","volume":"9","author":[{"given":"Wojciech","family":"Rytter","sequence":"first","affiliation":[]}],"member":"351","reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1145\/359842.359859"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1137\/0206024"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0209037","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,1,29]],"date-time":"2017-01-29T17:13:55Z","timestamp":1485710035000},"score":1,"resource":{"primary":{"URL":"http:\/\/epubs.siam.org\/doi\/10.1137\/0209037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,8]]},"references-count":2,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980,8]]}},"alternative-id":["10.1137\/0209037"],"URL":"https:\/\/doi.org\/10.1137\/0209037","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,8]]}}}