{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T16:39:31Z","timestamp":1718296771100},"reference-count":5,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,27]],"date-time":"2006-10-27T00:00:00Z","timestamp":1161907200000},"content-version":"vor","delay-in-days":9065,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1982,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Three string matching algorithms\u2014straightforward, Knuth\u2010Morris\u2010Pratt and Boyer\u2010Moor\u2014re examined and their time complexities discussed. A comparison of their actual average behaviour is made, based on empirical data presented. It is shown that the Boyel\u2010Moore algorithm is extremely efficient in most cases and that, contrary to the impression one might get from the analytical results, the Knuth\u2010Morris\u2010Pratt algorithm is not significantly better on the average than the straightforward algorithm.<\/jats:p>","DOI":"10.1002\/spe.4380120106","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T12:19:20Z","timestamp":1163765960000},"page":"57-66","source":"Crossref","is-referenced-by-count":31,"title":["A comparison of three string matching algorithms"],"prefix":"10.1002","volume":"12","author":[{"given":"G.","family":"De V. Smit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,27]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1137\/0206024"},{"key":"e_1_2_1_3_2","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho A. V.","year":"1976"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/359842.359859"},{"key":"e_1_2_1_5_2","unstructured":"K.Mehlhorn Private communication to D. E. Knuth (1977)."},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","unstructured":"L. J.GuibasandA. M.Odlyzko \u2018A new proof of the linearity of the Boyer\u2010Moore string searching algorithms\u2019 Proc. 18th Ann. IEEE Symp. Foundations of Computer Sci. 189\u2013195(1977).","DOI":"10.1109\/SFCS.1977.3"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380120106","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380120106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T04:13:31Z","timestamp":1696047211000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380120106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,1]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,1]]}},"alternative-id":["10.1002\/spe.4380120106"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380120106","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,1]]}}}