{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T14:34:22Z","timestamp":1758638062529},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6163,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1016\/0167-6423(96)00008-1","type":"journal-article","created":{"date-parts":[[2002,10,31]],"date-time":"2002-10-31T21:12:04Z","timestamp":1036098724000},"page":"85-118","source":"Crossref","is-referenced-by-count":20,"title":["A taxonomy of sublinear multiple keyword pattern matching algorithms"],"prefix":"10.1016","volume":"27","author":[{"given":"B.W.","family":"Watson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Zwaan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(96)00008-1_BIB1","first-page":"255","article-title":"Algorithms of finding patterns in strings","volume":"Vol. A","author":"Aho","year":"1990"},{"key":"10.1016\/0167-6423(96)00008-1_BIB2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","article-title":"Efficient string matching: An aid to bibliographic search","volume":"18","author":"Aho","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(96)00008-1_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":"Comm. ACM"},{"key":"10.1016\/0167-6423(96)00008-1_BIB4","series-title":"Computer Program Synthesis Methodologies","first-page":"1","article-title":"Program construction by transformations: a family tree of sorting programs","volume":"Vol. 95","author":"Broy","year":"1983"},{"key":"10.1016\/0167-6423(96)00008-1_BIB5","series-title":"Proc. ICALP '79","first-page":"118","article-title":"A string matching algorithm fast on the average","volume":"Vol. 71","author":"Commentz-Walter","year":"1979"},{"key":"10.1016\/0167-6423(96)00008-1_BIB6","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-09510-1_10","article-title":"A string matching algorithm fast on the average","author":"Commentz-Walter","year":"1979"},{"key":"10.1016\/0167-6423(96)00008-1_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00264597","article-title":"A synthesis of several sorting algorithms","volume":"11","author":"Darlington","year":"1978","journal-title":"Acta Inform."},{"key":"10.1016\/0167-6423(96)00008-1_BIB8","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0167-6423(96)00008-1_BIB9","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1109\/69.219740","article-title":"An efficient algorithm for matching multiple patterns","volume":"5","author":"Fan","year":"1993","journal-title":"IEEE Trans. Knowledge Data Eng."},{"key":"10.1016\/0167-6423(96)00008-1_BIB10","series-title":"Computer Algorithms: String Pattern Matching Strategies","article-title":"An efficient algorithm for matching multiple patterns","author":"Fan","year":"1994"},{"key":"10.1016\/0167-6423(96)00008-1_BIB11","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/367390.367400","article-title":"Trie memory","volume":"3","author":"Fredkin","year":"1960","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(96)00008-1_BIB12","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":"Softw. Pract. Exper."},{"key":"10.1016\/0167-6423(96)00008-1_BIB13","article-title":"Abstraction, Specification and Implementation Techniques, with an Application to Garbage Collection","volume":"Vol. 166","author":"Jonkers","year":"1983"},{"key":"10.1016\/0167-6423(96)00008-1_BIB14","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/0167-6423(96)00008-1_BIB15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(90)90055-I","article-title":"On the classification of attribute evaluation algorithms","volume":"14","author":"Marcelis","year":"1990","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(96)00008-1_BIB16","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1137\/0209037","article-title":"A correct preprocessing algorithm for Boyer-Moore string-searching","volume":"9","author":"Rytter","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6423(96)00008-1_BIB17","article-title":"The performance of single-keyword and multiple-keyword pattern matching algorithms","author":"Watson","year":"1994"},{"key":"10.1016\/0167-6423(96)00008-1_BIB18","article-title":"Taxonomies and toolkits of regular language algorithms","author":"Watson","year":"1995"},{"key":"10.1016\/0167-6423(96)00008-1_BIB19","article-title":"A taxonomy of keyword pattern matching algorithms","author":"Watson","year":"1992"},{"key":"10.1016\/0167-6423(96)00008-1_BIB20","series-title":"Proc. Computing Science in the Netherlands '93","first-page":"25","article-title":"A taxonomy of keyword pattern matching algorithms","author":"Watson","year":"1993"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642396000081?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642396000081?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T09:29:15Z","timestamp":1555406955000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642396000081"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0167642396000081"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(96)00008-1","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}