{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T13:37:08Z","timestamp":1762954628908},"reference-count":10,"publisher":"Wiley","issue":"10","license":[{"start":{"date-parts":[[2006,10,30]],"date-time":"2006-10-30T00:00:00Z","timestamp":1162166400000},"content-version":"vor","delay-in-days":5142,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1992,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Substring search is a common activity in computing. The fastest known search method is that of Boyer and Moore with the improvements introduced by Horspool. This paper presents a new implementation which takes advantage of the dependencies between the characters. The resulting code runs 25 per cent faster than the best currently\u2010known routine.<\/jats:p>","DOI":"10.1002\/spe.4380221006","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T19:06:42Z","timestamp":1163790402000},"page":"879-884","source":"Crossref","is-referenced-by-count":47,"title":["Tuning the boyer\u2010moore\u2010horspool string searching algorithm"],"prefix":"10.1002","volume":"22","author":[{"given":"Timo","family":"Raita","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,30]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/74697.74700"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/359842.359859"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1137\/0215007"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380190305"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/359146.359148"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1137\/0209051"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380100608"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1137\/0209037"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1137\/0217041"},{"key":"e_1_2_1_11_2","volume-title":"Information Theory with Applications","author":"Guiasu S.","year":"1977"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380221006","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380221006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T08:28:07Z","timestamp":1698049687000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380221006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":10,"journal-issue":{"issue":"10","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["10.1002\/spe.4380221006"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380221006","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}