{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T10:12:44Z","timestamp":1648894364181},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"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":7868,"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":[[1992,1]]},"DOI":"10.1016\/0304-3975(92)90141-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"165-179","source":"Crossref","is-referenced-by-count":1,"title":["Fast average-case pattern matching by multiplexing sparse tables"],"prefix":"10.1016","volume":"92","author":[{"given":"Russell W.","family":"Quong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90141-2_BIB1","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1137\/0216067","article-title":"Generalized string matching","volume":"16","author":"Abrahamson","year":"1987","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10.1016\/0304-3975(92)90141-2_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(92)90141-2_BIB3","unstructured":"M. Atallah, Private communication."},{"key":"10.1016\/0304-3975(92)90141-2_BIB4","series-title":"Proc. SWAT 90","first-page":"332","article-title":"Fast algorithms for two-dimensional and multiple pattern matching","volume":"Vol. 447","author":"Baeza-Yates","year":"1990"},{"issue":"10","key":"10.1016\/0304-3975(92)90141-2_BIB5","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(92)90141-2_BIB6","series-title":"Proc. 31st IEEE Symp. on Foundations of Computer Science","first-page":"116","article-title":"Approximate string matching in sublinear expected time","author":"Chang","year":"1990"},{"key":"10.1016\/0304-3975(92)90141-2_BIB7","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/0304-3975(92)90141-2_BIB8","series-title":"Complexity of Computation (SIAM-AMS Proceedings 7)","first-page":"113","article-title":"String matching and other products","author":"Fischer","year":"1974"},{"key":"10.1016\/0304-3975(92)90141-2_BIB9","first-page":"394","article-title":"An improved algorithm for approximate string matching","volume":"Vol. 372","author":"Galil","year":"1989"},{"key":"10.1016\/0304-3975(92)90141-2_BIB10","series-title":"Concrete Mathematics","author":"Graham","year":"1989"},{"key":"10.1016\/0304-3975(92)90141-2_BIB11","volume":"Vol. 2","author":"Knuth","year":"1981"},{"issue":"2","key":"10.1016\/0304-3975(92)90141-2_BIB12","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(92)90141-2_BIB13","series-title":"Proc. 18th ACM Symp. on Theory of Computing","first-page":"220","article-title":"Introducing efficient parallelism into approximate string matching and a new serial algorithm","author":"Landau","year":"1985"},{"issue":"2","key":"10.1016\/0304-3975(92)90141-2_BIB14","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"},{"issue":"6","key":"10.1016\/0304-3975(92)90141-2_BIB15","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","article-title":"On finding lowest common ancestors: simplification and parallelization","volume":"17","author":"Schieber","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90141-2_BIB16","series-title":"Proc. 14th IEEE Symp. on Switching and Automata Theory","first-page":"1","article-title":"Linear pattern matching algorithms","author":"Weiner","year":"1973"},{"issue":"3","key":"10.1016\/0304-3975(92)90141-2_BIB17","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1137\/0208029","article-title":"The complexity of pattern matching for a random string","volume":"8","author":"Yao","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90141-2_BIB18","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1145\/66451.66459","article-title":"A technique for two-dimensional pattern matching","volume":"32","author":"Zhu","year":"1989","journal-title":"Comm. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592901412?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592901412?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:56:31Z","timestamp":1555127791000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397592901412"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["0304397592901412"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90141-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}