{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T03:54:10Z","timestamp":1776743650246,"version":"3.51.2"},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"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":["Journal of Systems and Software"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1016\/0164-1212(93)90111-a","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T00:31:55Z","timestamp":1060302715000},"page":"207-216","source":"Crossref","is-referenced-by-count":2,"title":["A string pattern\u2014matching algorithm"],"prefix":"10.1016","volume":"22","author":[{"given":"Daniel K.","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0164-1212(93)90111-A_BIB1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/spe.4380120106","article-title":"A Comparison of Three String Matching Algorithms","volume":"12","author":"Smit","year":"1982","journal-title":"Software Pract. Exp."},{"key":"10.1016\/0164-1212(93)90111-A_BIB2","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast Pattern Matching in String","volume":"6","author":"Knuth","year":"1977","journal-title":"Siam J. Comput."},{"key":"10.1016\/0164-1212(93)90111-A_BIB3","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":"Commun. ACM"},{"key":"10.1016\/0164-1212(93)90111-A_BIB4","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0164-1212(91)90039-9","article-title":"Data Compression Using Hierarchical Dictionaries","volume":"15","author":"Chang","year":"1991","journal-title":"J. Syst. Software"},{"key":"10.1016\/0164-1212(93)90111-A_BIB5","first-page":"318","article-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0164-1212(93)90111-A_BIB6","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1137\/0209051","article-title":"A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm","volume":"9","author":"Guibas","year":"1980","journal-title":"Siam J. Comput."},{"key":"10.1016\/0164-1212(93)90111-A_BIB7","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","article-title":"Fast Pattern Matching: An Aid to Bibliographic Search","volume":"18","author":"Aho","year":"1975","journal-title":"Commun. ACM"}],"container-title":["Journal of Systems and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016412129390111A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016412129390111A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T22:57:59Z","timestamp":1552604279000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016412129390111A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["016412129390111A"],"URL":"https:\/\/doi.org\/10.1016\/0164-1212(93)90111-a","relation":{},"ISSN":["0164-1212"],"issn-type":[{"value":"0164-1212","type":"print"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}