{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:16Z","timestamp":1759638736554},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"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":6376,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,2]]},"DOI":"10.1016\/0304-3975(94)00270-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:48:18Z","timestamp":1027644498000},"page":"203-224","source":"Crossref","is-referenced-by-count":30,"title":["Multiple matching of parameterized patterns"],"prefix":"10.1016","volume":"154","author":[{"given":"Ramana M.","family":"Idury","sequence":"first","affiliation":[]},{"given":"Alejandro A.","family":"Sch\u00e4ffer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00270-3_BIB1","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":"Commun. ACM"},{"key":"10.1016\/0304-3975(94)00270-3_BIB2","series-title":"Proc 1st Ann. ACM-SIAM Symp. on Discrete Algorithms","first-page":"32","article-title":"Incremental evaluation of computational circuits","author":"Alpern","year":"1990"},{"key":"10.1016\/0304-3975(94)00270-3_BIB3","series-title":"Proc. 32nd IEEE Ann Symp. on Foundation of Computer Science","first-page":"760","article-title":"Adaptive dictionary matching","author":"Amir","year":"1991"},{"key":"10.1016\/0304-3975(94)00270-3_BIB4","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/S0022-0000(05)80047-9","article-title":"Dynamic dictionary matching","volume":"49","author":"Amir","year":"1994","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0304-3975(94)00270-3_BIB5","series-title":"Proc. 4th Ann. ACM-SIAM Symp. on Discrete Algorithms","first-page":"392","article-title":"Improved dynamic dictionary matching","author":"Amir","year":"1993"},{"key":"10.1016\/0304-3975(94)00270-3_BIB6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0020-0190(94)90086-8","article-title":"Alphabet dependence in parameterized matching","volume":"49","author":"Amir","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)00270-3_BIB7","series-title":"Proc. 25th Ann. ACM Symp. on Theory of Computing","first-page":"71","article-title":"A theory of parameterized pattern matching: algorithms and applications","author":"Baker","year":"1993"},{"key":"10.1016\/0304-3975(94)00270-3_BIB8","series-title":"Combinatorial Algorithms on Words","first-page":"97","article-title":"Efficient and elegant subword tree construction","author":"Chen","year":"1985"},{"key":"10.1016\/0304-3975(94)00270-3_BIB9","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/0304-3975(94)00270-3_BIB10","series-title":"Proc. 19th Ann. ACM Symp. on Theory of Computing","first-page":"365","article-title":"Two algorithms for maintaining order in a list","author":"Dietz","year":"1987"},{"key":"10.1016\/0304-3975(94)00270-3_BIB11","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","article-title":"Making data structures persistent","volume":"38","author":"Driscoll","year":"1989","journal-title":"J. Comput Systems Sci."},{"key":"10.1016\/0304-3975(94)00270-3_BIB12","first-page":"331","article-title":"A note on set union with arbitrary deunions","volume":"37","author":"Galil","year":"1991"},{"key":"10.1016\/0304-3975(94)00270-3_BIB13","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0020-0255(82)90058-5","article-title":"The parenthesis tree","volume":"27","author":"G\u00fcting","year":"1982","journal-title":"Inform. Sci."},{"key":"10.1016\/0304-3975(94)00270-3_BIB14","article-title":"Dynamic multiple pattern matching","author":"Idury","year":"1993"},{"key":"10.1016\/0304-3975(94)00270-3_BIB15_1","series-title":"Proc. 3rd Symp. on Combinatorial Pattern Matching","first-page":"276","article-title":"Dynamic dictionary matching with failure functions","volume":"Vol. 644","author":"Idury","year":"1992"},{"key":"10.1016\/0304-3975(94)00270-3_BIB15_2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0304-3975(94)90176-7","volume":"131","author":"Idury","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00270-3_BIB16","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."},{"key":"10.1016\/0304-3975(94)00270-3_BIB17","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space-economical suffix tree construction algorithm","volume":"23","author":"McCreight","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00270-3_BIB18","series-title":"Data Structures and Algorithms 1: Sorting and Searching","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/0304-3975(94)00270-3_BIB19","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0190(85)90088-2","article-title":"Incremental string matching","volume":"21","author":"Meyer","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)00270-3_BIB20","series-title":"Proc. 14th IEEE Ann. Symp. on Switching and Automata Theory","first-page":"1","article-title":"Linear pattern matching algorithm","author":"Weiner","year":"1973"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594002703?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594002703?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:52:28Z","timestamp":1555419148000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594002703"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["0304397594002703"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00270-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}