{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T11:55:54Z","timestamp":1776858954962,"version":"3.51.2"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030850876","type":"print"},{"value":"9783030850883","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":"https:\/\/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":"https:\/\/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-85088-3_10","type":"book-chapter","created":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T23:03:24Z","timestamp":1630883004000},"page":"117-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Perfectly Clustering Words are Primitive Positive Elements of the Free Group"],"prefix":"10.1007","author":[{"given":"M\u00e9lodie","family":"Lapointe","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,6]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Berstel, J., Lauve, A., Reutenauer, C., Saliola, F.V.: Combinatorics on Words. CRM Monograph Series, vol. 27. American Mathematical Society, Providence, RI (2009). Christoffel words and repetitions in words","DOI":"10.1090\/crmm\/027"},{"issue":"1\u20132","key":"10_CR2","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0304-3975(96)00101-6","volume":"178","author":"J Berstel","year":"1997","unstructured":"Berstel, J., de Luca, A.: Sturmian words, Lyndon words and trees. Theoret. Comput. Sci. 178(1\u20132), 171\u2013203 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s00605-014-0721-4","volume":"176","author":"V Berth\u00e9","year":"2015","unstructured":"Berth\u00e9, V., et al.: Acyclic, connected and tree sets. Monatsh. Math. 176, 521\u2013550 (2015). https:\/\/doi.org\/10.1007\/s00605-014-0721-4","journal-title":"Monatsh. Math."},{"key":"10_CR4","unstructured":"Burrows, M., Wheeler, D.J.: A block sorting data compression algorithm, p. 18. Technical report, Digital System Research Center (1994)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s11854-010-0031-2","volume":"112","author":"S Ferenczi","year":"2010","unstructured":"Ferenczi, S., Zamboni, L.Q.: Structure of $$K$$-interval exchange transformations: induction, trajectories, and distance theorems. J. Anal. Math. 112, 289\u2013328 (2010)","journal-title":"J. Anal. Math."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Kassel, C., Reutenauer, C.: Sturmian morphisms, the braid group $$B_4$$, Christoffel words and bases of $$F_2$$. Ann. Mat. Pura Appl. 186(2), 317\u2013339 (2007)","DOI":"10.1007\/s10231-006-0008-z"},{"key":"10_CR7","unstructured":"Lapointe, M.: Number of orbits of discrete interval exchanges. Discrete Math. Theor. Comput. Sci. 21(3), 16 (2019). Paper No. 17"},{"key":"10_CR8","unstructured":"Lapointe, M.: Combinatoire des mots: mots parfaitement amassants, triplets de Markoff et graphes chenilles. Ph.D. thesis, Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al, Montr\u00e9al, Qu\u00e9bec, Canada (October 2020). https:\/\/archipel.uqam.ca\/14120\/"},{"key":"10_CR9","series-title":"Classics in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61896-3","volume-title":"Combinatorial Group Theory","author":"RC Lyndon","year":"2001","unstructured":"Lyndon, R.C., Schupp, P.E.: Combinatorial Group Theory. CM, vol. 89. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/978-3-642-61896-3"},{"issue":"5","key":"10_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0020-0190(02)00512-4","volume":"86","author":"S Mantaci","year":"2003","unstructured":"Mantaci, S., Restivo, A., Sciortino, M.: Burrows-Wheeler transform and Sturmian words. Inf. Process. Lett. 86(5), 241\u2013246 (2003)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01389191","volume":"63","author":"RP Osborne","year":"1981","unstructured":"Osborne, R.P., Zieschang, H.: Primitives in the free group on two generators. Invent. Math. 63(1), 17\u201324 (1981)","journal-title":"Invent. Math."},{"key":"10_CR12","volume-title":"From Christoffel Words to Markoff Numbers","author":"C Reutenauer","year":"2019","unstructured":"Reutenauer, C.: From Christoffel Words to Markoff Numbers. Oxford University Press, Oxford (2019)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Simpson, J., Puglisi, S.J.: Words with simple Burrows-Wheeler transforms. Electron. J. Combin. 15(1), 1\u201317 (2008). Research Paper 83","DOI":"10.37236\/807"}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85088-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T23:04:27Z","timestamp":1630883067000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85088-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030850876","9783030850883"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85088-3_10","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":"6 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WORDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorics on Words","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwords2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/words2021.sciencesconf.org\/","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":"18","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":"11","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":"3","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":"61% - 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":"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)"}},{"value":"2 invited papers are also included","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)"}}]}}