{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:24:19Z","timestamp":1742988259830,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031132568"},{"type":"electronic","value":"9783031132575"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-13257-5_4","type":"book-chapter","created":{"date-parts":[[2022,8,21]],"date-time":"2022-08-21T23:02:52Z","timestamp":1661122972000},"page":"43-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Clusters of\u00a0Repetition Roots Forming Prefix 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":[[2022,8,22]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","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)","DOI":"10.1137\/15M1011032"},{"issue":"2","key":"4_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":"4","key":"4_CR3","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":"4_CR4","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":"4_CR5","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":"4_CR6","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? Disc. Appl. Math. 180, 52\u201369 (2015)","journal-title":"Disc. Appl. Math."},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-030-67731-2_29","volume-title":"SOFSEM 2021: Theory and Practice of Computer Science","author":"SZ Fazekas","year":"2021","unstructured":"Fazekas, S.Z., Merca\u015f, R.: Clusters of repetition roots: single chains. In: Bure\u0161, T., et al. (eds.) SOFSEM 2021. LNCS, vol. 12607, pp. 400\u2013409. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67731-2_29"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.tcs.2021.08.004","volume":"894","author":"SZ Fazekas","year":"2021","unstructured":"Fazekas, S.Z., Seki, S.: Square network on a word. Theor. Comput. Sci. 894, 121\u2013134 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Fraenkel, A., Simpson, J.: How many squares must a binary sequence contain? Electron. J. Comb. 2, R2 (1995)","DOI":"10.37236\/1196"},{"issue":"1","key":"4_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. Comb. Theory Ser. A 82(1), 112\u2013120 (1998)","journal-title":"J. Comb. Theory Ser. A"},{"key":"4_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":"4_CR12","unstructured":"Hickerson, D.: Less than $$2n$$ distinct squares in a word of length $$n$$ (2003). Communicated by Dan Gusfield"},{"issue":"1","key":"4_CR13","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. Comb. Theory Ser. A 112(1), 163\u2013164 (2005)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"3","key":"4_CR14","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":"4_CR15","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":"4_CR16","doi-asserted-by":"crossref","unstructured":"Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: Proceedings of 40th FOCS, pp. 596\u2013604. IEEE Computer Society Press (1999)","DOI":"10.1109\/SFFCS.1999.814634"},{"key":"4_CR17","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)"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-319-23660-5_14","volume-title":"Combinatorics on Words","author":"F Manea","year":"2015","unstructured":"Manea, F., Seki, S.: Square-density increasing mappings. In: Manea, F., Nowotka, D. (eds.) WORDS 2015. LNCS, vol. 9304, pp. 160\u2013169. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23660-5_14"},{"key":"4_CR19","unstructured":"Storer, J.A.: Data Compression: Methods and Theory. Computer Science Press, Inc. (1988)"},{"key":"4_CR20","unstructured":"Thierry, A.: A proof that a word of length n has less than 1.5n distinct squares (2020). https:\/\/arxiv.org\/abs\/2001.02996"},{"key":"4_CR21","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Kra. Vidensk. Selsk. Skrifter. I Mat. Nat. Kl. 7 (1906)"},{"key":"4_CR22","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","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-13257-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,2]],"date-time":"2024-10-02T05:18:24Z","timestamp":1727846304000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-13257-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031132568","9783031132575"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-13257-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"22 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Debrecen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hungary","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/konferencia.unideb.hu\/en\/dcfs-2022","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":"17","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":"14","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":"0","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":"82% - 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","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":"2.3","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)"}}]}}