{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:19:09Z","timestamp":1771024749686,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1984,9,1]],"date-time":"1984-09-01T00:00:00Z","timestamp":462844800000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1984,9]]},"DOI":"10.1016\/0196-6774(84)90021-x","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"422-432","source":"Crossref","is-referenced-by-count":205,"title":["An O(n log n) algorithm for finding all repetitions in a string"],"prefix":"10.1016","volume":"5","author":[{"given":"Michael G","family":"Main","sequence":"first","affiliation":[]},{"given":"Richard J","family":"Lorentz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(84)90021-X_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1976"},{"key":"10.1016\/0196-6774(84)90021-X_BIB2_1","doi-asserted-by":"crossref","first-page":"261","DOI":"10.2140\/pjm.1979.85.261","article-title":"Avoidable patterns in strings of symbols","volume":"85","author":"Bean","year":"1979","journal-title":"Pacific J. Math."},{"key":"10.1016\/0196-6774(84)90021-X_BIB3_1","first-page":"675","article-title":"Solution to problem 5030","volume":"70","author":"Braunholtz","year":"1963","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0196-6774(84)90021-X_BIB4_1","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0022-0000(71)80006-5","article-title":"Classification of noncounting events","volume":"5","author":"Brzozowski","year":"1971","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(84)90021-X_BIB5","article-title":"Determination optimale des repetitions dans un mot","author":"Crochemore","year":"1981"},{"key":"10.1016\/0196-6774(84)90021-X_BIB6_1","first-page":"536","article-title":"Strongly asymmetric sequences generated by a finite number of symbols","volume":"9","author":"Evdokimov","year":"1968","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0196-6774(84)90021-X_BIB7","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1145\/322047.322056","article-title":"A linear-time on-line recognition algorithm for palstar","volume":"25","author":"Galil","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(84)90021-X_BIB8_1","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/S0022-0000(76)80010-4","article-title":"Bounded AFLS","volume":"12","author":"Goldstin","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(84)90021-X_BIB9_1","first-page":"36","article-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0196-6774(84)90021-X_BIB10_1","first-page":"148","article-title":"Remarks on the work of Axel Thue on sequences","volume":"16","author":"Hedlund","year":"1967","journal-title":"Nordisk. Mat. Tidskr."},{"key":"10.1016\/0196-6774(84)90021-X_BIB11_1","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/0097-3165(72)90101-X","article-title":"Generalisation du theoreme de van de Waerden sur les semigroupes repetitifs","volume":"12","author":"Justin","year":"1972","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0196-6774(84)90021-X_BIB12","first-page":"73","article-title":"Fundamental Algorithms","author":"Knuth","year":"1973"},{"key":"10.1016\/0196-6774(84)90021-X_BIB13","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\/0196-6774(84)90021-X_BIB14_1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.2307\/3610126","article-title":"A problem on strings of beads","volume":"41","author":"Leech","year":"1957","journal-title":"Math. Gaz."},{"key":"10.1016\/0196-6774(84)90021-X_BIB15","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1145\/321892.321896","article-title":"A new linear-time on-line algorithm for finding the smallest initial palindrome of a string","volume":"22","author":"Manacher","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(84)90021-X_BIB16_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1215\/S0012-7094-44-01101-4","article-title":"Unending chess, symbolic dynamics and a problem in semigroups","volume":"11","author":"Morse","year":"1944","journal-title":"Duke Math. J."},{"key":"10.1016\/0196-6774(84)90021-X_BIB17_1","first-page":"267","article-title":"Nonrepetitive sequences","volume":"68","author":"Pleasants","year":"1970"},{"key":"10.1016\/0196-6774(84)90021-X_BIB18_1","series-title":"Eighth International Conference on Automata and Programming Languages","first-page":"175","article-title":"A new characterization of the regular languages","author":"Reutenauer","year":"1981"},{"key":"10.1016\/0196-6774(84)90021-X_BIB19_1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01768472","article-title":"Real-time recognition of substring repetition and reversal","volume":"11","author":"Seiferas","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0196-6774(84)90021-X_BIB20_1","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1080\/00207167708803136","article-title":"A strongly primitive word of arbitrary length and its applications","author":"Shyr","year":"1977","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0196-6774(84)90021-X_BIB21","first-page":"1","article-title":"Uber unendliche Zeichenreihen","author":"Thue","year":"1906","journal-title":"Norske Vid. Selsk. Skr. Mat.-Nat. Kl. (Kristiania)"},{"key":"10.1016\/0196-6774(84)90021-X_BIB22","first-page":"1","article-title":"Uber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen","author":"Thue","year":"1912","journal-title":"Norske Vid. Selsk. Skr. Mat.-Nat. Kl (Kristiania)"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667748490021X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667748490021X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:50:06Z","timestamp":1548726606000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667748490021X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,9]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,9]]}},"alternative-id":["019667748490021X"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(84)90021-x","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1984,9]]}}}