{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T00:18:18Z","timestamp":1768263498820,"version":"3.49.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"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":6894,"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":[[1994,9]]},"DOI":"10.1016\/0304-3975(94)90176-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"295-310","source":"Crossref","is-referenced-by-count":10,"title":["Dynamic dictionary matching with failure functions"],"prefix":"10.1016","volume":"131","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)90176-7_BIB1","series-title":"Handbook of Theoretical Computer Science","first-page":"255","article-title":"Algorithms for Finding Patterns in Strings","author":"Aho","year":"1990"},{"key":"10.1016\/0304-3975(94)90176-7_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\/0304-3975(94)90176-7_BIB3","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1109\/SFCS.1991.185445","article-title":"Adaptive dictionary matching","author":"Amir","year":"1991","journal-title":"Proc. 32nd IEEE Symp. Found. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90176-7_BIB4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0020-0190(92)90206-B","article-title":"Two-dimensional dictionary matching","volume":"44","author":"Amir","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)90176-7_BIB5","doi-asserted-by":"crossref","unstructured":"A. Amir, M. Farach, Z. Galil, R. Giancarlo and K. Park, Dynamic dictionary matching, J. Comput. System Sci., to appear.","DOI":"10.1016\/S0022-0000(05)80047-9"},{"key":"10.1016\/0304-3975(94)90176-7_BIB6","first-page":"392","article-title":"Improved dynamic dictionary matching","author":"Amir","year":"1993","journal-title":"Proc. 4th Ann. ACM-SIAM Symp. on Discrete Algorithms"},{"key":"10.1016\/0304-3975(94)90176-7_BIB7","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\/0304-3975(94)90176-7_BIB8","first-page":"97","article-title":"Efficient and elegant subword-tree construction","volume":"Vol. F12","author":"Chen","year":"1985"},{"key":"10.1016\/0304-3975(94)90176-7_BIB9","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\/0304-3975(94)90176-7_BIB10","first-page":"365","article-title":"Two algorithms for maintaining order in a list","author":"Dietz","year":"1987","journal-title":"Proc. 19th ACM Symp. Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90176-7_BIB11","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)90176-7_BIB12","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)90176-7_BIB13","series-title":"Data Structures and Algorithms 1: Sorting and Searching","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/0304-3975(94)90176-7_BIB14","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)90176-7_BIB15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/SWAT.1973.13","article-title":"Linear pattern matching algorithms","author":"Weiner","year":"1973","journal-title":"Proc. 14th IEEE Symp. on Switching and Automata Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901767?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901767?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T06:16:36Z","timestamp":1580883396000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594901767"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0304397594901767"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90176-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}