{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T17:55:26Z","timestamp":1768326926476,"version":"3.49.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1993,8]]},"DOI":"10.1016\/0020-0190(93)90156-4","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T19:27:56Z","timestamp":1034278076000},"page":"51-57","source":"Crossref","is-referenced-by-count":9,"title":["Tight comparison bounds for the string prefix-matching problem"],"prefix":"10.1016","volume":"47","author":[{"given":"Dany","family":"Breslauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Livio","family":"Colussi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laura","family":"Toniolo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90156-4_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(93)90156-4_BIB2","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\/0020-0190(93)90156-4_BIB3","doi-asserted-by":"crossref","DOI":"10.1006\/jcom.1993.1022","article-title":"Efficient comparison based string matching","author":"Breslauer","year":"1993","journal-title":"J. Complexity"},{"key":"10.1016\/0020-0190(93)90156-4_BIB4","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1109\/SFCS.1992.267791","article-title":"Tighter bounds on the exact complexity of string matching","author":"Cole","year":"1992","journal-title":"Proc. 33rd IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(93)90156-4_BIB5","first-page":"225","article-title":"Correctness and efficiency of string matching algorithm","volume":"95","author":"Colussi","year":"1991","journal-title":"Inform. and Control"},{"issue":"6","key":"10.1016\/0020-0190(93)90156-4_BIB6","doi-asserted-by":"crossref","first-page":"1008","DOI":"10.1137\/0220063","article-title":"On the exact complexity of string matching lower bounds","volume":"20","author":"Galil","year":"1991","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0020-0190(93)90156-4_BIB7","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1137\/0221028","article-title":"The exact complexity of string matching: upper bounds","volume":"21","author":"Galil","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(93)90156-4_BIB8","doi-asserted-by":"crossref","first-page":"322","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\/0020-0190(93)90156-4_BIB9","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1137\/0206048","article-title":"On the worst case behavior of string-searching algorithms","volume":"6","author":"Rivest","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(93)90156-4_BIB10","author":"Zwick","year":"1991","journal-title":"Lower bounds for string matching in the sequential comparison model"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093901564?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093901564?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T08:52:34Z","timestamp":1554972754000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019093901564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["0020019093901564"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90156-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}