{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:00Z","timestamp":1759638720821},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"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":5221,"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":[[1999,4]]},"DOI":"10.1016\/s0304-3975(98)00260-6","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"205-216","source":"Crossref","is-referenced-by-count":10,"title":["Quasiperiodicity and string covering"],"prefix":"10.1016","volume":"218","author":[{"given":"Costas S.","family":"Iliopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Mouchard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0304-3975(98)00260-6_BIB1","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0304-3975(93)90159-Q","article-title":"Efficient detection of quasiperiodicities in strings","volume":"119","author":"Apostolico","year":"1993","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0304-3975(98)00260-6_BIB2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0020-0190(91)90056-N","article-title":"Optimal superprimitivity testing for strings","volume":"39","author":"Apostolico","year":"1991","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/S0304-3975(98)00260-6_BIB3","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\/S0304-3975(98)00260-6_BIB4","series-title":"Proc. 5th ACM-SIAM Ann. Symp. on Discrete Algorithms","first-page":"501","article-title":"The subtree max gap problem with application to parallel string covering","author":"Ben-Amram","year":"1994"},{"issue":"5","key":"10.1016\/S0304-3975(98)00260-6_BIB5","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1137\/0221050","article-title":"A lower bound for parallel string matching","volume":"21","author":"Breslauer","year":"1992","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10.1016\/S0304-3975(98)00260-6_BIB6","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0020-0190(92)90111-8","article-title":"An on-line string superprimitivity test","volume":"44","author":"Breslauer","year":"1992","journal-title":"Inform. Process. Lett."},{"issue":"5","key":"10.1016\/S0304-3975(98)00260-6_BIB7","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0020-0190(94)90060-4","article-title":"Testing string superprimitivity in parallel","volume":"49","author":"Breslauer","year":"1994","journal-title":"Inform. Process. Lett."},{"issue":"5","key":"10.1016\/S0304-3975(98)00260-6_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":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(98)00260-6_BIB9","first-page":"1175","article-title":"Une caract\u00e9risation des mots p\u00e9riodiques","author":"C\u00e9sari","year":"1978","journal-title":"Comptes Rendus Acad. Sci. Paris S\u00e9r. I Math."},{"key":"10.1016\/S0304-3975(98)00260-6_BIB10","article-title":"Contribution \u00e0 la combinatoire du mono\u00efde libre","author":"Duval","year":"1980"},{"key":"10.1016\/S0304-3975(98)00260-6_BIB11","author":"Duval","year":"1997"},{"key":"10.1016\/S0304-3975(98)00260-6_BIB12","first-page":"109","article-title":"Uniqueness theorems for periodic functions","volume":"16","author":"Fine","year":"1965"},{"key":"10.1016\/S0304-3975(98)00260-6_BIB13","series-title":"Proc. 4th Ann. Symp. on Combinatorial Pattern Matching","first-page":"54","article-title":"Covering a string","volume":"vol. 684","author":"Iliopoulos","year":"1993"},{"issue":"8","key":"10.1016\/S0304-3975(98)00260-6_BIB14","first-page":"1400","article-title":"An optimal o(log log n)-time algorithm for parallel superprimitivity testing","volume":"21","author":"Iliopoulos","year":"1994","journal-title":"J. Korea Inform. Sci. Soc."},{"issue":"164","key":"10.1016\/S0304-3975(98)00260-6_BIB15","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0304-3975(96)00047-3","article-title":"An o(log log n) pram algorithm for computing all the seeds of a string","volume":"2","author":"Iliopoulos","year":"1996","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0304-3975(98)00260-6_BIB16","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\/S0304-3975(98)00260-6_BIB17","series-title":"Combinatorics on Words","author":"Lothaire","year":"1983"},{"key":"10.1016\/S0304-3975(98)00260-6_BIB18","series-title":"An optimal on-line algorithm to compute all the covers of a string","author":"Li","year":"1998"},{"key":"10.1016\/S0304-3975(98)00260-6_BIB19","series-title":"Proc. 11th Ann. Symp. on Theoretical Aspects of Computer Science","first-page":"661","article-title":"Nondeterminism in patterns","volume":"vol. 775","author":"Mateescu","year":"1994"},{"key":"10.1016\/S0304-3975(98)00260-6_BIB20","first-page":"1","article-title":"\u00dcber die gegenseitige lage gleicher teile gewisser zeichenreichen","volume":"1","author":"Thue","year":"1912","journal-title":"Nor. Vidensk. Selsk. Skr. Mat. Nat. Kl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002606?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002606?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T00:51:15Z","timestamp":1555375875000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598002606"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["S0304397598002606"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00260-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}