{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:30Z","timestamp":1761611070624},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"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":7229,"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":[[1993,10]]},"DOI":"10.1016\/0304-3975(93)90159-q","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"247-265","source":"Crossref","is-referenced-by-count":63,"title":["Efficient detection of quasiperiodicities in strings"],"prefix":"10.1016","volume":"119","author":[{"given":"Alberto","family":"Apostolico","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Ehrenfeucht","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90159-Q_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 Inform. Theor."},{"key":"10.1016\/0304-3975(93)90159-Q_BIB2","series-title":"NATO ASI Series F","first-page":"85","article-title":"The myriad virtues of subword trees","volume":"Vol. 12","author":"Apostolico","year":"1985"},{"key":"10.1016\/0304-3975(93)90159-Q_BIB3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF01758848","article-title":"Optimal parallel detection of squares in strings","volume":"8","author":"Apostolico","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/0304-3975(93)90159-Q_BIB4","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(93)90159-Q_BIB5","series-title":"NATO ASI Series F","volume":"Vol. 12","year":"1985"},{"key":"10.1016\/0304-3975(93)90159-Q_BIB6","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\/0304-3975(93)90159-Q_BIB7","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/0022-0000(85)90060-1","article-title":"Structural properties of the string statistics problem","volume":"31","author":"Apostolico","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90159-Q_BIB8","first-page":"19","article-title":"A representation of linear lists with movable fingers","author":"Brown","year":"1978","journal-title":"Proc. 10th STOC"},{"key":"10.1016\/0304-3975(93)90159-Q_BIB9","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":"Inform. Process. Lett."},{"issue":"Serie I","key":"10.1016\/0304-3975(93)90159-Q_BIB10","first-page":"781","article-title":"Recherche lineaire d'un carr\u00e9 dans un mot","volume":"296","author":"Crochemore","year":"1983","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/0304-3975(93)90159-Q_BIB11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0304-3975(91)90073-B","article-title":"Usefulness of the Karp-Miller-Rosenberg strategy in the design of parallel algorithms","volume":"88","author":"Crochemore","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90159-Q_BIB12","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0196-6774(83)90017-2","article-title":"Factorizing words over an ordered alphabet","volume":"4","author":"Duval","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(93)90159-Q_BIB13","series-title":"Combinatorics on Words","author":"Lothaire","year":"1982"},{"key":"10.1016\/0304-3975(93)90159-Q_BIB14","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1307\/mmj\/1028998766","article-title":"The equation aM = cNcPz in a free group","volume":"9","author":"Lyndon","year":"1962","journal-title":"Michigan Math. J."},{"key":"10.1016\/0304-3975(93)90159-Q_BIB15","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":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(93)90159-Q_BIB16","series-title":"Nato ASI Series F","first-page":"271","article-title":"Linear-time recognition of square-free strings","volume":"Vol. 12","author":"Main","year":"1985"},{"key":"10.1016\/0304-3975(93)90159-Q_BIB17","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space economical suffix tree construction algorithm","volume":"25","author":"McCreight","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90159-Q_BIB18","series-title":"Nato ASI Series F","first-page":"279","article-title":"Discovering repetitions in strings","volume":"Vol. 12","author":"Rabin","year":"1985"},{"key":"10.1016\/0304-3975(93)90159-Q_BIB19","first-page":"1","article-title":"\u00dcber unendliche Zeichenreihen","author":"Thue","year":"1906","journal-title":"Christiania No. 7"},{"key":"10.1016\/0304-3975(93)90159-Q_BIB20","first-page":"1","article-title":"\u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen","author":"Thue","year":"1912","journal-title":"Christiania No. 1"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390159Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390159Q?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:40:47Z","timestamp":1621032047000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390159Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["030439759390159Q"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90159-q","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}