{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:51:11Z","timestamp":1773481871704,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030677305","type":"print"},{"value":"9783030677312","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-67731-2_29","type":"book-chapter","created":{"date-parts":[[2021,1,20]],"date-time":"2021-01-20T10:07:45Z","timestamp":1611137265000},"page":"400-409","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Clusters of Repetition Roots: Single Chains"],"prefix":"10.1007","author":[{"given":"Szil\u00e1rd Zsolt","family":"Fazekas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Merca\u015f","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,11]]},"reference":[{"issue":"5","key":"29_CR1","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1137\/15M1011032","volume":"46","author":"HIT Bannai","year":"2017","unstructured":"Bannai, H.I.T., Inenaga, S., Nakashima, Y., Takeda, M., Tsuruta, K.: The \u201cruns\u201d theorem. SIAM J. Comput. 46(5), 1501\u20131514 (2017)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"29_CR2","first-page":"465","volume":"19","author":"F Blanchet-Sadri","year":"2009","unstructured":"Blanchet-Sadri, F., Merca\u015f, R., Scott, G.: Counting distinct squares in partial words. Acta Cybern. 19(2), 465\u2013477 (2009)","journal-title":"Acta Cybern."},{"issue":"8\u201310","key":"29_CR3","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1016\/j.tcs.2008.11.006","volume":"410","author":"F Blanchet-Sadri","year":"2009","unstructured":"Blanchet-Sadri, F., Merca\u015f, R., Scott, G.: A generalization of Thue freeness for partial words. Theor. Comput. Sci. 410(8\u201310), 793\u2013800 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"29_CR4","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1142\/S0129054110007416","volume":"21","author":"M Crochemore","year":"2010","unstructured":"Crochemore, M., Fazekas, S., Iliopoulos, C., Jayasekera, I.: Number of occurrences of powers in strings. Int. J. Found. Comput. Sci. 21(4), 535\u2013547 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"6","key":"29_CR5","doi-asserted-by":"publisher","first-page":"1828","DOI":"10.1016\/j.jcss.2011.12.005","volume":"78","author":"M Crochemore","year":"2012","unstructured":"Crochemore, M., Iliopoulos, C., Kubica, M., Radoszewski, J., Rytter, W., Wale\u0144, T.: The maximal number of cubic runs in a word. J. Comput. System Sci. 78(6), 1828\u20131836 (2012)","journal-title":"J. Comput. System Sci."},{"issue":"5","key":"29_CR6","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF01190846","volume":"13","author":"M Crochemore","year":"1995","unstructured":"Crochemore, M., Rytter, W.: Squares, cubes, and time-space efficient string searching. Algorithmica 13(5), 405\u2013425 (1995)","journal-title":"Algorithmica"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/0097-3165(76)90023-6","volume":"20","author":"F Dekking","year":"1976","unstructured":"Dekking, F.: On repetitions of blocks in binary sequences. J. Combin. Theory Ser. A 20, 292\u2013299 (1976)","journal-title":"J. Combin. Theory Ser. A"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.dam.2014.08.016","volume":"180","author":"A Deza","year":"2015","unstructured":"Deza, A., Franek, F., Thierry, A.: How many double squares can a string contain? Discrete Appl. Math. 180, 52\u201369 (2015)","journal-title":"Discrete Appl. Math."},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Fraenkel, A., Simpson, J.: How many squares must a binary sequence contain? Electron. J. Combin. 2, #R2 (1995)","DOI":"10.37236\/1196"},{"issue":"1","key":"29_CR10","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1006\/jcta.1997.2843","volume":"82","author":"A Fraenkel","year":"1998","unstructured":"Fraenkel, A., Simpson, J.: How many squares can a string contain? J. Combin. Theory Ser. A 82(1), 112\u2013120 (1998)","journal-title":"J. Combin. Theory Ser. A"},{"key":"29_CR11","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, Cambridge (1997)"},{"key":"29_CR12","unstructured":"Hickerson, D.: Less than $$2n$$ distinct squares in a word of length $$n$$, communicated by Dan Gusfield (2003)"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2017.01.026","volume":"684","author":"\u0160 Holub","year":"2017","unstructured":"Holub, \u0160.: Prefix frequency of lost positions. Theoretical Comput. Sci. 684, 43\u201352 (2017)","journal-title":"Theoretical Comput. Sci."},{"issue":"1","key":"29_CR14","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.jcta.2005.01.006","volume":"112","author":"L Ilie","year":"2005","unstructured":"Ilie, L.: A simple proof that a word of length $$n$$ has at most $$2n$$ distinct squares. J. Combin. Theory Ser. A 112(1), 163\u2013164 (2005)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"3","key":"29_CR15","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.tcs.2007.03.025","volume":"380","author":"L Ilie","year":"2007","unstructured":"Ilie, L.: A note on the number of squares in a word. Theoret. Comput. Sci. 380(3), 373\u2013376 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-319-04298-5_30","volume-title":"SOFSEM 2014: Theory and Practice of Computer Science","author":"N Jonoska","year":"2014","unstructured":"Jonoska, N., Manea, F., Seki, S.: A stronger square conjecture on binary words. In: Geffert, V., Preneel, B., Rovan, B., \u0160tuller, J., Tjoa, A.M. (eds.) SOFSEM 2014. LNCS, vol. 8327, pp. 339\u2013350. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04298-5_30"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Wale\u0144, T.: Maximum number of distinct and nonequivalent nonstandard squares in a word. Theor. Comput. Sci. 648(C), 84\u201395, October 2016","DOI":"10.1016\/j.tcs.2016.08.010"},{"key":"29_CR18","unstructured":"Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: Proceedings 40th FOCS, pp. 596\u2013604. IEEE Computer Society Press (1999)"},{"key":"29_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words","author":"M Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)"},{"issue":"1","key":"29_CR20","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.tcs.2005.01.005","volume":"339","author":"N Rampersad","year":"2005","unstructured":"Rampersad, N., Shallit, J., Wang, M.W.: Avoiding large squares in infinite binary words. Theor. Comput. Sci. 339(1), 19\u201334 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR21","unstructured":"Storer, J.A.: Data Compression: Methods and Theory. Press, Inc., Comp. Sci (1988)"},{"key":"29_CR22","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Kra. Vidensk. Selsk. Skrifter. I Mat. Nat. Kl. 7 (1906)"},{"key":"29_CR23","unstructured":"Thue, A.: \u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Kra. Vidensk. Selsk. Skrifter. I Mat. Nat. Kl. 1 (1912)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2021: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67731-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T22:02:33Z","timestamp":1619301753000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-67731-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030677305","9783030677312"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67731-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bolzano-Bozen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem2021.inf.unibz.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}