{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:43:47Z","timestamp":1757616227873,"version":"3.44.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10090,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004415","name":"North Atlantic Treaty Organization","doi-asserted-by":"publisher","award":["039.82"],"award-info":[{"award-number":["039.82"]}],"id":[{"id":"10.13039\/100004415","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1985,12]]},"DOI":"10.1016\/0022-0000(85)90060-1","type":"journal-article","created":{"date-parts":[[2003,12,3]],"date-time":"2003-12-03T06:59:35Z","timestamp":1070434775000},"page":"394-411","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":21,"title":["Structural properties of the string statistics problem"],"prefix":"10.1016","volume":"31","author":[{"given":"A.","family":"Apostolico","sequence":"first","affiliation":[]},{"given":"F.P.","family":"Preparata","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"No. 2","key":"10.1016\/0022-0000(85)90060-1_BIB1","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1051\/ita\/1984180201471","article-title":"On context constrained squares and repetitions in a string","volume":"18","author":"Apostolico","year":"1984","journal-title":"RAIRO J. Theoret. Inform."},{"year":"1974","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","key":"10.1016\/0022-0000(85)90060-1_BIB2"},{"issue":"No. 1","key":"10.1016\/0022-0000(85)90060-1_BIB3","doi-asserted-by":"crossref","DOI":"10.1137\/0215007","article-title":"The Boyer-Moore-Galil string searching strategy revisited","volume":"15","author":"Apostolico","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(85)90060-1_BIB4","series-title":"Combinatorial Algorithms on Words","article-title":"The myriad virtues of subword trees","author":"Apostolico","year":"1985"},{"key":"10.1016\/0022-0000(85)90060-1_BIB5","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","article-title":"Optimal off-line detection of repetitions in a string","volume":"22","author":"Apostolico","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(85)90060-1_BIB6","doi-asserted-by":"crossref","first-page":"323","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\/0022-0000(85)90060-1_BIB7","first-page":"781","article-title":"Recherche lin\u00e9aire d'un carrel dans un mot","volume":"2966","author":"Crochemore","year":"1983","journal-title":"C. R. Acad. Sci. Paris Ser. I"},{"issue":"No. 5","key":"10.1016\/0022-0000(85)90060-1_BIB8","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","article-title":"An optimal algorithm for computing the repetitions in a word","volume":"12","author":"Crochemore","year":"1981","journal-title":"IPL"},{"key":"10.1016\/0022-0000(85)90060-1_BIB9","series-title":"Proceeding, ICALP","first-page":"241","article-title":"On improving the worst case running time of the Boyer-Moore string matching algorithm","volume":"Vol. 62","author":"Galil","year":"1978"},{"key":"10.1016\/0022-0000(85)90060-1_BIB10","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\/0022-0000(85)90060-1_BIB11","series-title":"Proceedings, University of North Carolina","first-page":"128","article-title":"A combinatorial problem in the theory of free monoids","author":"Lentin","year":"1967"},{"key":"10.1016\/0022-0000(85)90060-1_BIB12","series-title":"Combinatorial Algorithms on Words","article-title":"Linear time recognition of square-free strings","author":"Lorentz","year":"1985"},{"year":"1983","series-title":"Combinatorics on Words","author":"Lothaire","key":"10.1016\/0022-0000(85)90060-1_BIB13"},{"key":"10.1016\/0022-0000(85)90060-1_BIB14","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\/0022-0000(85)90060-1_BIB15","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\/0022-0000(85)90060-1_BIB16","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","article-title":"An O(n log n) algorithm for finding all Repetitions in a string","volume":"5","author":"Main","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0022-0000(85)90060-1_BIB17","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1137\/0209061","article-title":"Efficient on-line construction and correction of position trees","volume":"9","author":"Majster","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(85)90060-1_BIB18","series-title":"Proceedings, 14th Annual Symposium on Switching and Automa Theory","article-title":"Linear pattern matching algorithms","author":"Weiner","year":"1973"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000085900601?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000085900601?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T18:11:06Z","timestamp":1757095866000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000085900601"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["0022000085900601"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(85)90060-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[1985,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Structural properties of the string statistics problem","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0022-0000(85)90060-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1985 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}