{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,21]],"date-time":"2024-07-21T17:52:21Z","timestamp":1721584341441},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"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":4672,"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":[[2000,10]]},"DOI":"10.1016\/s0304-3975(00)00065-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:17Z","timestamp":1027594757000},"page":"313-324","source":"Crossref","is-referenced-by-count":4,"title":["Normal forms of quasiperiodic strings"],"prefix":"10.1016","volume":"249","author":[{"given":"Laurent","family":"Mouchard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0304-3975(00)00065-7_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(00)00065-7_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(00)00065-7_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(00)00065-7_BIB4","unstructured":"A. Ben-Amram, O. Berkman, C.S. Iliopoulos, K. Park, The subtree max gap problem with application to parallel string covering, 5th ACM-SIAM Ann. Symp. on Discrete Algorithms, Arlington, VA, 1994, pp. 501\u2013510."},{"key":"10.1016\/S0304-3975(00)00065-7_BIB5","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"issue":"1","key":"10.1016\/S0304-3975(00)00065-7_BIB6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","article-title":"The smallest automaton recognizing the subwords of a text","volume":"40","author":"Blumer","year":"1985","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"10.1016\/S0304-3975(00)00065-7_BIB7","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."},{"key":"10.1016\/S0304-3975(00)00065-7_BIB8","doi-asserted-by":"crossref","unstructured":"D. Breslauer, Testing string superprimitivity in parallel, Report CUCS-053-92, Computer Science Department, Columbia University, NY, 1992.","DOI":"10.21236\/ADA267814"},{"key":"10.1016\/S0304-3975(00)00065-7_BIB9","series-title":"Text Algorithms","author":"Crochemore","year":"1994"},{"key":"10.1016\/S0304-3975(00)00065-7_BIB10","unstructured":"A.M. Duval, W.M. Smyth, Covering a circular string with substrings of fixed length, Internat. J. Found. Comput. Sci. (1998), (to appear)."},{"key":"10.1016\/S0304-3975(00)00065-7_BIB11","doi-asserted-by":"crossref","unstructured":"C.S. Iliopoulos, D.W.G. Moore, K. Park, Covering a string, in: A. Apostolico, M. Crochemore, Z. Galil, U. Manber (Eds.), Proc. 4th Ann. Symp. on Combinatorial Pattern Matching, Lecture Notes in Computer Science, Vol. 684, Padova, Italy, Springer, Berlin, 1993, pp. 54\u201362.","DOI":"10.1007\/BFb0029796"},{"key":"10.1016\/S0304-3975(00)00065-7_BIB12","unstructured":"C.S. Iliopoulos, L. Mouchard, An o(nlog n) algorithm for computing all maximal quasiperiodicities in strings, in: C.S. Calude, M.J. Dinneen (Eds.), Combinatorics, Computations and Logic. Proc. DMTCS\u201999 and CATS\u201999, (vol. 21) Lecture Notes in Computer Science, Auckland, New-Zealand, Springer-Verlag, Singapore, 1999, pp. 262\u2013272."},{"issue":"8","key":"10.1016\/S0304-3975(00)00065-7_BIB13","first-page":"1400","article-title":"An optimal o(log log n)-time algorithm fir parallel superprimitivity testing","volume":"21","author":"Iliopoulos","year":"1994","journal-title":"J. Korea Inform. Sci. Soc."},{"issue":"1","key":"10.1016\/S0304-3975(00)00065-7_BIB14","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."},{"issue":"5","key":"10.1016\/S0304-3975(00)00065-7_BIB15","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0020-0190(94)00045-X","article-title":"An optimal algorithm to compute all the covers of a string","volume":"50","author":"Moore","year":"1994","journal-title":"Inform. Process. Lett."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000657?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000657?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T04:48:34Z","timestamp":1578458914000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500000657"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,10]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,10]]}},"alternative-id":["S0304397500000657"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00065-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,10]]}}}