{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:10:07Z","timestamp":1763467807484},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732075"},{"type":"electronic","value":"9783540732082"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73208-2_27","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T07:58:11Z","timestamp":1189583891000},"page":"278-289","source":"Crossref","is-referenced-by-count":2,"title":["Avoiding Approximate Squares"],"prefix":"10.1007","author":[{"given":"Dalia","family":"Krieger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Ochem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Narad","family":"Rampersad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method, 2nd edn. Wiley, Chichester (2000)","edition":"2"},{"key":"27_CR2","unstructured":"Berstel, J.: Axel Thue\u2019s Papers on Repetitions in Words: a Translation. Number\u00a020 in Publications du Laboratoire de Combinatoire et d\u2019Informatique Math\u00e9matique. Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al (February 1995)"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(88)90009-6","volume":"23","author":"F.-J. Brandenburg","year":"1983","unstructured":"Brandenburg, F.-J.: Uniformly growing k-th power-free homomorphisms. Theoret. Comput. Sci.\u00a023, 69\u201382 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11821069_20","volume-title":"Mathematical Foundations of Computer Science 2006","author":"A. Carpi","year":"2006","unstructured":"Carpi, A.: On the repetition threshold for large alphabets. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 226\u2013237. Springer-Verlag, Heidelberg (2006)"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1080\/00207160213939","volume":"79","author":"E. Cambouropoulos","year":"2002","unstructured":"Cambouropoulos, E., Crochemore, M., Iliopoulos, C.S., Mouchard, L., Pinzon, Y.J.: Algorithms for computing approximate repetitions in musical sequences. Intern. J. Comput. Math.\u00a079, 1135\u20131148 (2002)","journal-title":"Intern. J. Comput. Math."},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/0097-3165(72)90011-8","volume":"13","author":"F. Dejean","year":"1972","unstructured":"Dejean, F.: Sur un th\u00e9or\u00e8me de Thue. J. Comb. Theory. Ser. A\u00a013, 90\u201399 (1972)","journal-title":"J. Comb. Theory. Ser. A"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0097-3165(74)90041-7","volume":"16","author":"R.C. Entringer","year":"1974","unstructured":"Entringer, R.C., Jackson, D.E., Schatz, J.A.: On nonrepetitive sequences. J. Combin. Theory. Ser. A\u00a016, 159\u2013164 (1974)","journal-title":"J. Combin. Theory. Ser. A"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/BFb0029801","volume-title":"CPM 93","author":"G.M. Landau","year":"1993","unstructured":"Landau, G.M., Schmidt, J.P.: An algorithm for approximate tandem repeats. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.) CPM 93. LNCS, vol.\u00a0684, pp. 120\u2013133. Springer-Verlag, Heidelberg (1993)"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(02)00448-6","volume":"303","author":"R. Kolpakov","year":"2003","unstructured":"Kolpakov, R., Kucherov, G.: Finding approximate repetitions under Hamming distance. Theor. Comput. Sci.\u00a0303, 135\u2013156 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1016\/j.ejc.2005.11.005","volume":"28","author":"M. Mohammad-Noori","year":"2007","unstructured":"Mohammad-Noori, M., Currie, J.D.: Dejean\u2019s conjecture and Sturmian words. European J. Combin.\u00a028, 876\u2013890 (2007)","journal-title":"European J. Combin."},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0304-3975(92)90264-G","volume":"95","author":"J. Moulin-Ollagnier","year":"1992","unstructured":"Moulin-Ollagnier, J.: Proof of Dejean\u2019s conjecture for alphabets with 5,6,7,8,9,10 and 11 letters. Theoret. Comput. Sci.\u00a095, 187\u2013205 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR12","unstructured":"Nagell, T. (ed.): Selected Mathematical Papers of Axel Thue. Universitetsforlaget, Oslo (1977)"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0166-218X(84)90006-4","volume":"7","author":"J.-J. Pansiot","year":"1984","unstructured":"Pansiot, J.-J.: A propos d\u2019une conjecture de F. Dejean sur les r\u00e9p\u00e9titions dans les mots. Discrete Appl. Math.\u00a07, 297\u2013311 (1984)","journal-title":"Discrete Appl. Math."},{"key":"27_CR14","first-page":"1","volume":"7","author":"A. Thue","year":"1906","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl.\u00a07, 1\u201322 (1906) Reprinted in [pp. 139\u2013158]","journal-title":"Norske vid. Selsk. Skr. Mat. Nat. Kl."},{"key":"27_CR15","first-page":"1","volume":"1","author":"A. Thue","year":"1912","unstructured":"Thue, A.: \u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl.\u00a01, 1\u201367 (1912) Reprinted in [pp. 413\u2013478]","journal-title":"Norske vid. Selsk. Skr. Mat. Nat. Kl."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73208-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T01:34:16Z","timestamp":1558488856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73208-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540732075","9783540732082"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73208-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}