{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T04:34:03Z","timestamp":1649133243470},"reference-count":6,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1994,6]]},"DOI":"10.1016\/0020-0190(94)00042-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"269-275","source":"Crossref","is-referenced-by-count":0,"title":["Single character searching methods and the shift-or pattern-matching algorithm"],"prefix":"10.1016","volume":"50","author":[{"given":"Chris H.","family":"Perleberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00042-5_BIB1","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"},{"issue":"10","key":"10.1016\/0020-0190(94)00042-5_BIB2","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/135239.135243","article-title":"A new approach to text searching","volume":"35","author":"Baeza-Yates","year":"1992","journal-title":"Comm. ACM"},{"issue":"11","key":"10.1016\/0020-0190(94)00042-5_BIB3","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1002\/spe.4380211105","article-title":"Fast string searching","volume":"21","author":"Hume","year":"1991","journal-title":"Software - Practice and Experience"},{"key":"10.1016\/0020-0190(94)00042-5_BIB4","article-title":"Three longest substring algorithms","author":"Perleberg","year":"1993"},{"key":"10.1016\/0020-0190(94)00042-5_BIB5","first-page":"419","article-title":"Faster string functions","author":"Spencer","year":"1992","journal-title":"Proc. Winter 1992 USENIX Conf."},{"key":"10.1016\/0020-0190(94)00042-5_BIB6","first-page":"153","article-title":"Agrep - a fast approximate pattern-matching tool","author":"Wu","year":"1992","journal-title":"Proc. USENIX Winter 1992 Technical Conf."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000425?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000425?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:22:15Z","timestamp":1555132935000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094000425"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["0020019094000425"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00042-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}