{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T20:43:46Z","timestamp":1778273026897,"version":"3.51.4"},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,2,1]],"date-time":"1983-02-01T00:00:00Z","timestamp":412905600000},"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":11124,"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":[[1983,2]]},"DOI":"10.1016\/0304-3975(83)90109-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"297-315","source":"Crossref","is-referenced-by-count":153,"title":["Optimal off-line detection of repetitions in a string"],"prefix":"10.1016","volume":"22","author":[{"given":"A.","family":"Apostolico","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.P.","family":"Preparata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90109-3_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(83)90109-3_BIB2","first-page":"558","article-title":"Fast applications of suffix trees","author":"Apostolico","year":"1980"},{"key":"10.1016\/0304-3975(83)90109-3_BIB3","first-page":"675","article-title":"Solution to Problem 5030","volume":"70","author":"Braunholtz","year":"1963","journal-title":"Ann. of Math."},{"issue":"5","key":"10.1016\/0304-3975(83)90109-3_BIB4","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":"Information Processing Lett."},{"key":"10.1016\/0304-3975(83)90109-3_BIB5","series-title":"Th\u00e9se de Docteur du 3me cycle","article-title":"Sur la p\u00e9riodicit\u00e9 des mots","author":"Duval","year":"1978"},{"key":"10.1016\/0304-3975(83)90109-3_BIB6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","article-title":"Uniqueness theorems for periodic functions","volume":"16","author":"Fine","year":"1965","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(83)90109-3_BIB7","series-title":"Introduction to Formal Language Theory","first-page":"36","author":"Harrison","year":"1978"},{"key":"10.1016\/0304-3975(83)90109-3_BIB8","first-page":"148","article-title":"Remarks on the work of Axel Thue on sequences","volume":"15","author":"Hedlund","year":"1967","journal-title":"Nord. Mat. Tidskr."},{"key":"10.1016\/0304-3975(83)90109-3_BIB9","series-title":"The Art of Computer Programming, Vol 3: Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/0304-3975(83)90109-3_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\/0304-3975(83)90109-3_BIB11","first-page":"128","article-title":"A combinatorial problem in the theory of free monoids","author":"Lentin","year":"1967","journal-title":"Proc. University of North Carolina"},{"key":"10.1016\/0304-3975(83)90109-3_BIB12","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(83)90109-3_BIB13","series-title":"T.R. 79-056","article-title":"An O(n log n) algorithm for finding repetition in a string","author":"Main","year":"1979"},{"key":"10.1016\/0304-3975(83)90109-3_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"},{"key":"10.1016\/0304-3975(83)90109-3_BIB15","series-title":"Proc. MAC Conference on Concurrent Systems and Parallel Computation","first-page":"119","article-title":"Comparative schematology","author":"Peterson","year":"1970"},{"key":"10.1016\/0304-3975(83)90109-3_BIB16","first-page":"1","article-title":"\u00dcber die gegenseitige Lage gleicher Teile Gewisser Zeichenreichen","volume":"1","author":"Thue","year":"1912","journal-title":"Skr. Vid.-Kristiana I. Mat. Naturv. Klasse"},{"key":"10.1016\/0304-3975(83)90109-3_BIB17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/SWAT.1973.13","article-title":"Linear pattern matching algorithms","author":"Weiner","year":"1973","journal-title":"Proc. 14th Annual Symposium on Switching and Automata Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583901093?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583901093?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T22:57:47Z","timestamp":1621033067000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583901093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,2]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,2]]}},"alternative-id":["0304397583901093"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90109-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983,2]]}}}