{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:04:32Z","timestamp":1725728672370},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642390524"},{"type":"electronic","value":"9783642390531"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39053-1_24","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T04:28:12Z","timestamp":1370233692000},"page":"210-219","source":"Crossref","is-referenced-by-count":3,"title":["Discovering Hidden Repetitions in Words"],"prefix":"10.1007","author":[{"given":"Pawe\u0142","family":"Gawrychowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florin","family":"Manea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Nowotka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.tcs.2009.09.037","volume":"411","author":"E. Czeizler","year":"2010","unstructured":"Czeizler, E., Kari, L., Seki, S.: On a special class of primitive words. Theoretical Computer Science\u00a0411, 617\u2013630 (2010)","journal-title":"Theoretical Computer Science"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1007\/978-3-642-32589-2_58","volume-title":"Mathematical Foundations of Computer Science 2012","author":"F. Manea","year":"2012","unstructured":"Manea, F., Merca\u015f, R., Nowotka, D.: Fine and Wilf\u2019s theorem and pseudo-repetitions. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol.\u00a07464, pp. 668\u2013680. Springer, Heidelberg (2012)"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-642-31653-1_37","volume-title":"Developments in Language Theory","author":"F. Manea","year":"2012","unstructured":"Manea, F., M\u00fcller, M., Nowotka, D.: The avoidability of cubes under permutations. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol.\u00a07410, pp. 416\u2013427. Springer, Heidelberg (2012)"},{"key":"24_CR4","unstructured":"Gawrychowski, P., Manea, F., Merca\u015f, R., Nowotka, D., Tiseanu, C.: Finding pseudo-repetitions. In: Proc. STACS (to appear, 2013)"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on strings. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511546853"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J. K\u00e4rkk\u00e4inen","year":"2006","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. ACM\u00a053, 918\u2013936 (2006)","journal-title":"J. ACM"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"N.J. Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorem for periodic functions. Proceedings of the American Mathematical Society\u00a016, 109\u2013114 (1965)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"24_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences: computer science and computational biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, New York (1997)"},{"issue":"2","key":"24_CR9","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0020-0190(79)90135-2","volume":"9","author":"A. Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Finding a Homomorphism Between Two Words is NP-Complete. Inf. Process. Lett.\u00a09(2), 86\u201388 (1979)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","The Nature of Computation. Logic, Algorithms, Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39053-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T16:57:14Z","timestamp":1557766634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39053-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642390524","9783642390531"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39053-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}