{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:14:14Z","timestamp":1725495254222},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540676331"},{"type":"electronic","value":"9783540451235"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45123-4_32","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T14:59:14Z","timestamp":1194965954000},"page":"388-396","source":"Crossref","is-referenced-by-count":0,"title":["Periods and Quasiperiods Characterization"],"prefix":"10.1007","author":[{"given":"Mireille","family":"R\u00e9gnier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Mouchard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,7]]},"reference":[{"issue":"2","key":"32_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0304-3975(93)90159-Q","volume":"119","author":"A. Apostolico","year":"1993","unstructured":"A. Apostolico and A. Ehrenfeucht. Efficient detection of quasiperiodicities in strings. Theoretical Computer Science, 119(2):247\u2013265, 1993.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"32_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0020-0190(91)90056-N","volume":"39","author":"A. Apostolico","year":"1991","unstructured":"A. Apostolico, M. Farach and C. S. Iliopoulos. Optimal superprimitivity testing for strings. Information Processing Letters, 39(1):17\u201320, 1991.","journal-title":"Information Processing Letters"},{"issue":"6","key":"32_CR3","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0020-0190(92)90111-8","volume":"44","author":"D. Breslauer","year":"1992","unstructured":"D. Breslauer. An on-line string superprimitivity test. Information Processing Letters, 44(6):345\u2013347, 1992.","journal-title":"Information Processing Letters"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0097-3165(81)90005-4","volume":"30","author":"L. Guibas","year":"1981","unstructured":"L. Guibas and A.M. Odlyzko. String Overlaps, Pattern Matching and Nontransitive Games. Journal of Combinatorial Theory, Series A, 30:183\u2013208, 1981.","journal-title":"Journal of Combinatorial Theory, Series A"},{"issue":"3","key":"32_CR5","first-page":"213","volume":"4","author":"C.S. Iliopoulos","year":"1999","unstructured":"C.S. Iliopoulos and L. Mouchard. Quasiperiodicity: from detection to normal forms. Journal of Automata, Languages and Combinatorics, 4(3):213\u2013228, 1999.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"32_CR6","series-title":"Lect Notes Comput Sci","first-page":"262","volume-title":"Combinatorics, Computation and Logic. Proceedings of DMTCS\u201999 and CATS\u201999","author":"C. S. Iliopoulos","year":"1999","unstructured":"C. S. Iliopoulos and L. Mouchard. An o(n logn) algorithm for computing all maximal quasiperiodicities in strings. In C. S. Calude and M. J. Dinneen, editors, Combinatorics, Computation and Logic. Proceedings of DMTCS\u201999 and CATS\u201999, Lecture Notes in Computer Science, pages 262\u2013272, Auckland, New-Zealand, 1999."},{"issue":"1","key":"32_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0304-3975(98)00260-6","volume":"218","author":"C.S. Iliopoulos","year":"1999","unstructured":"C.S. Iliopoulos and L. Mouchard. Quasiperiodicity and string covering. Theoretical Computer Science, 218(1):205\u2013216, 1999.","journal-title":"Theoretical Computer Science"},{"key":"32_CR8","volume-title":"Combinatorics on Words","author":"Lothaire","year":"1983","unstructured":"Lothaire. Combinatorics on Words. Addison-Wesley, Reading, Mass., 1983."},{"key":"32_CR9","unstructured":"F. Mignosi and A. Restivo. Periodicity (Chapter 9). Algebraic Combinatorics on Words. to appear; preliminary version at \n                    http:\/\/www-igm.univ-mlv.fr\/~berstel\/Lothaire\/2000\n                    \n                  ."},{"key":"32_CR10","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1051\/ita\/1992260403031","volume":"264","author":"M. R\u00e9gnier","year":"1992","unstructured":"M. R\u00e9gnier. Enumeration of bordered words. RAIRO Theoretical Informatics and Applications, 26,4:303\u2013317, 1992.","journal-title":"RAIRO Theoretical Informatics and Applications"},{"key":"32_CR11","unstructured":"M. R\u00e9gnier. A Unified Approach to Word Occurrences Probabilities. Discrete Applied Mathematics, 1999. to appear; preliminary version at RECOMB\u201998."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45123-4_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T01:53:27Z","timestamp":1551059607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45123-4_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676331","9783540451235"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45123-4_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}