{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T18:16:21Z","timestamp":1649182581460},"reference-count":27,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"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":6194,"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,8]]},"DOI":"10.1016\/0304-3975(95)00137-9","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"117-144","source":"Crossref","is-referenced-by-count":0,"title":["How the character comparison order shapes the shift function of on-line pattern matching algorithms"],"prefix":"10.1016","volume":"163","author":[{"given":"Livio","family":"Colussi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laura","family":"Toniolo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00137-9_BIB1","first-page":"257","article-title":"Algorithms for finding patterns in strings","author":"Aho","year":"1990"},{"key":"10.1016\/0304-3975(95)00137-9_BIB2","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(95)00137-9_BIB3","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1137\/0215007","article-title":"The Boyer-Moore-Galil string searching strategies revisited","volume":"15","author":"Apostolico","year":"1986","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0304-3975(95)00137-9_BIB4","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/spe.4380190305","article-title":"Improved string searching","volume":"19","author":"Baeza-Yates","year":"1989","journal-title":"Software Practice and Experience"},{"key":"10.1016\/0304-3975(95)00137-9_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(95)00137-9_BIB6","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0020-0190(93)90156-4","article-title":"Tight comparison bounds for the string prefix-matching problem","volume":"47","author":"Breslauer","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(95)00137-9_BIB7","first-page":"483","article-title":"On the exact complexity of the string prefix-matching problem","volume":"Vol. 855","author":"Breslauer","year":"1994"},{"key":"10.1016\/0304-3975(95)00137-9_BIB8","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1006\/jcom.1993.1022","article-title":"Efficient comparison based string matching","volume":"32","author":"Breslauer","year":"1993","journal-title":"J. Complexity"},{"key":"10.1016\/0304-3975(95)00137-9_BIB9","series-title":"Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms","first-page":"224","article-title":"Tight bounds on the complexity of the Boyer-Moore pattern matching algorithm","author":"Cole","year":"1991"},{"key":"10.1016\/0304-3975(95)00137-9_BIB10","series-title":"Proc. 33rd IEEE Symp. on Foundations of Comput. Sci.","first-page":"600","article-title":"Tighter bounds on the exact complexity of string matching","author":"Cole","year":"1992"},{"key":"10.1016\/0304-3975(95)00137-9_BIB11","first-page":"225","article-title":"Correctness and efficiency of string matching algorithms","volume":"95","author":"Colussi","year":"1991","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(95)00137-9_BIB12","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1006\/jagm.1994.1008","article-title":"Fastest pattern matching in strings","volume":"16","author":"Colussi","year":"1994","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(95)00137-9_BIB13","series-title":"Proc. 31st IEEE Symp. on Foundations of Computer Science","first-page":"135","article-title":"On the exact complexity of string matching","author":"Colussi","year":"1990"},{"key":"10.1016\/0304-3975(95)00137-9_BIB14","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/0304-3975(95)00137-9_BIB15","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0304-3975(92)90134-2","article-title":"String-matching on ordered alphabets","volume":"92","author":"Crochemore","year":"1992","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/0304-3975(95)00137-9_BIB16","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1145\/116825.116845","article-title":"Two-way string-matching","volume":"38","author":"Crochemore","year":"1991","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(95)00137-9_BIB17","series-title":"Proc. of the Sequences '91 Workshop: Sequences II: Methods in Communication, Security and Computer Science","first-page":"153","article-title":"Periodic prefixes in texts","author":"Crochemore","year":"1993"},{"key":"10.1016\/0304-3975(95)00137-9_BIB18","article-title":"Limiti superiori e inferiori per la complessit\u00e0 di una classe di algoritmi di string matching","author":"Favaretto","year":"1994"},{"issue":"3","key":"10.1016\/0304-3975(95)00137-9_BIB19","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\/0304-3975(95)00137-9_BIB20","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/0022-0000(83)90002-8","article-title":"Time-space-optimal string matching","volume":"26","author":"Galil","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00137-9_BIB21","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0190(93)90231-W","article-title":"On Simon string searching algorithm","volume":"47","author":"Hancart","year":"1993","journal-title":"Inform. Process. Lett."},{"issue":"11","key":"10.1016\/0304-3975(95)00137-9_BIB22","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":"Software Practice and Experience"},{"key":"10.1016\/0304-3975(95)00137-9_BIB23","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\/0304-3975(95)00137-9_BIB24","series-title":"Combinatorics on Words","author":"Lothaire","year":"1983"},{"key":"10.1016\/0304-3975(95)00137-9_BIB25","series-title":"1st South-American Workshop on String Processing","article-title":"String Matching Algorithms and Automata","author":"Simon","year":"1993"},{"issue":"1","key":"10.1016\/0304-3975(95)00137-9_BIB26","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/spe.4380120106","article-title":"A Comparison of Three string matching algorithms","volume":"12","author":"Smit","year":"1982","journal-title":"Software Practice and Experience"},{"key":"10.1016\/0304-3975(95)00137-9_BIB27","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01683268","article-title":"Design and implementation of an efficient priority queue","volume":"10","author":"van Emde Boas","year":"1977","journal-title":"Math. Systems Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001379?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001379?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:54:14Z","timestamp":1555404854000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001379"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0304397595001379"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00137-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}