{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T07:49:07Z","timestamp":1672386547278},"reference-count":30,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"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":6286,"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,5]]},"DOI":"10.1016\/0304-3975(95)00068-2","type":"journal-article","created":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T01:37:28Z","timestamp":1051753048000},"page":"177-192","source":"Crossref","is-referenced-by-count":8,"title":["Saving comparisons in the Crochemore-Perrin string-matching algorithm"],"prefix":"10.1016","volume":"158","author":[{"given":"Dany","family":"Breslauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00068-2_BIB1","first-page":"257","article-title":"Algorithms for finding patterns in strings","volume":"Vol. A","author":"Aho","year":"1990"},{"issue":"1","key":"10.1016\/0304-3975(95)00068-2_BIB2","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."},{"key":"10.1016\/0304-3975(95)00068-2_BIB3","series-title":"Proc. 20th IEEE Symp. on Foundations of Computer Science","first-page":"294","article-title":"A time-space tradeoff for sorting on non-oblivious machines","author":"Borodin","year":"1979"},{"key":"10.1016\/0304-3975(95)00068-2_BIB4","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"},{"issue":"3","key":"10.1016\/0304-3975(95)00068-2_BIB5","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1006\/jcom.1993.1022","article-title":"Efficient comparison based string matching","volume":"9","author":"Breslauer","year":"1993","journal-title":"J. Complexity"},{"issue":"A","key":"10.1016\/0304-3975(95)00068-2_BIB6","first-page":"1175","article-title":"Une caract\u00e9risation des mots p\u00e9riodiques","volume":"286","author":"C\u00e9sari","year":"1978","journal-title":"C.R. Acad. Sci. Paris"},{"issue":"5","key":"10.1016\/0304-3975(95)00068-2_BIB7","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1137\/S0097539791195543","article-title":"Tight bounds on the complexity of the Boyer-Moore string matching a algorithm","volume":"23","author":"Cole","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00068-2_BIB8","series-title":"Proc. 33rd IEEE Symp. on Foundations of Computer Science","first-page":"600","article-title":"Tighter bounds on the exact complexity of string matching","author":"Cole","year":"1992"},{"key":"10.1016\/0304-3975(95)00068-2_BIB9","series-title":"Proc. 2nd Israeli Symp. on Theory of Computing and Systems","first-page":"59","article-title":"Which patterns are hard to find","author":"Cole","year":"1993"},{"key":"10.1016\/0304-3975(95)00068-2_BIB10","first-page":"225","article-title":"Correctness and efficiency of string matching algorithms","volume":"95","author":"Colussi","year":"1992","journal-title":"Inform. and Control"},{"issue":"2","key":"10.1016\/0304-3975(95)00068-2_BIB11","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)00068-2_BIB12","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."},{"key":"10.1016\/0304-3975(95)00068-2_BIB13","series-title":"Proc. 9th Symp. on Theoretical Aspects of Computer Science","first-page":"589","article-title":"Speeding up two string-matching algorithms","volume":"Vol. 577","author":"Crochemore","year":"1992"},{"issue":"3","key":"10.1016\/0304-3975(95)00068-2_BIB14","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)00068-2_BIB15","series-title":"Proc. Sequences'91 Workshop: \u201cSequences II: Methods in Communication, Security and Computer Science\u201d","first-page":"153","article-title":"Periodic prefixes in texts","author":"Crochemore","year":"1993"},{"key":"10.1016\/0304-3975(95)00068-2_BIB16","first-page":"109","article-title":"Uniqueness theorems for periodic functions","volume":"16","author":"Fine","year":"1965"},{"issue":"6","key":"10.1016\/0304-3975(95)00068-2_BIB17","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\/0304-3975(95)00068-2_BIB18","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)00068-2_BIB19","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1137\/0209032","article-title":"Saving space in fast string-matching","volume":"2","author":"Galil","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00068-2_BIB20","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0304-3975(81)80006-0","article-title":"Linear-time string-matching using only a fixed number of local storage locations","volume":"13","author":"Galil","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00068-2_BIB21","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)00068-2_BIB22","series-title":"Three one-way heads cannot do string-matching","author":"Ger\u00e9b-Graus","year":"1990"},{"key":"10.1016\/0304-3975(95)00068-2_BIB23","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0097-3165(81)90038-8","article-title":"Periods in strings","volume":"30","author":"Guibas","year":"1981","journal-title":"J. Combin. Theory, Ser. A"},{"key":"10.1016\/0304-3975(95)00068-2_BIB24","series-title":"Proc. 25th ACM Symp. on Theory of Computing","first-page":"62","article-title":"k one-way heads cannot do string matching","author":"Jiang","year":"1993"},{"key":"10.1016\/0304-3975(95)00068-2_BIB25","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)00068-2_BIB26","article-title":"Lower bounds on string-matching","author":"Li","year":"1984"},{"key":"10.1016\/0304-3975(95)00068-2_BIB27","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0020-0190(86)90099-2","article-title":"String-matching cannot be done by a two-head one-way deterministic finite automaton","volume":"22","author":"Li","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(95)00068-2_BIB28","series-title":"Combinatorics on Words","author":"Lothaire","year":"1983"},{"key":"10.1016\/0304-3975(95)00068-2_BIB29","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1307\/mmj\/1028998766","article-title":"The equation am = bncp in a free group","volume":"9","author":"Lyndon","year":"1962","journal-title":"Michigan Math. J."},{"key":"10.1016\/0304-3975(95)00068-2_BIB30","series-title":"Lower bounds for string matching in the sequential comparison model","author":"Zwick","year":"1991"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000682?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000682?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T18:17:52Z","timestamp":1620929872000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595000682"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0304397595000682"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00068-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}