{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T01:44:35Z","timestamp":1776822275689,"version":"3.51.2"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031975479","type":"print"},{"value":"9783031975486","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-97548-6_10","type":"book-chapter","created":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T10:48:46Z","timestamp":1751194126000},"page":"104-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Clustering of\u00a0Return Words in\u00a0Languages of\u00a0Interval Exchanges"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8936-1395","authenticated-orcid":false,"given":"Francesco","family":"Dolce","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-3391-9924","authenticated-orcid":false,"given":"Christian B.","family":"Hughes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,30]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Berth\u00e9, V., et al.: Acyclic, connected and tree sets. Monatshefte f\u00fcr Mathematik 176(4), 521\u2013550 (2015)","DOI":"10.1007\/s00605-014-0721-4"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Berth\u00e9, V., et al.: Bifix codes and interval exchanges. J. Pure Appl. Algebra 219(7), 2781\u20132798 (2015)","DOI":"10.1016\/j.jpaa.2014.09.028"},{"key":"10_CR3","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Syst. Res. Center - Res. Rep, 24 (1994)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Crochemore, M., D\u00e9sarmenien, J., Perrin, D.: A note on the BurrowsWheeler transformation. Theor. Comput. Sci. 332, 567\u2013572 (2005)","DOI":"10.1016\/j.tcs.2004.11.014"},{"issue":"3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1051\/ita\/2017004","volume":"51","author":"F Dolce","year":"2017","unstructured":"Dolce, F., Perrin, D.: Interval exchanges, admissibility and branching Rauzy induction. RAIRO - Theor. Inform. Appl. 51(3), 141\u2013166 (2017)","journal-title":"RAIRO - Theor. Inform. Appl."},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Ferenczi, S., Hubert, P., Zamboni, L.Q.: Order conditions for languages. In: Frid, A., Merca\u015f, R. (eds) International Conference on Combinatorics on Words, Lecture Notes in Computer Science, pp. 155\u2013167. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-33180-0_12","DOI":"10.1007\/978-3-031-33180-0_12"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Ferenczi, S., Hubert, P., Zamboni, L.Q.: Languages of general interval exchange transformations. Annali della Scuola Normale Superiore - Classe di Scienze, 33 (2024)","DOI":"10.2422\/2036-2145.202302_006"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1112\/blms\/bdn051","volume":"40","author":"S Ferenczi","year":"2008","unstructured":"Ferenczi, S., Zamboni, L.Q.: Languages of $$k$$-interval exchange transformations. Bull. Lond. Math. Soc. 40(3), 705\u2013714 (2008)","journal-title":"Bull. Lond. Math. Soc."},{"key":"10_CR9","unstructured":"Ferenczi, S., Zamboni, L.Q.: Clustering words and interval exchanges. J. Integer Sequences, 16 (2013)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Kanel-Belov, A.Y., Chernyat\u2019ev, A.L.: Describing the set of words generated by interval exchange transformations. Commun. Algebra 38, 2588\u20132605 (2010)","DOI":"10.1080\/00927870903032932"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Keane, M.: Interval exchange transformations. Mathematische Zeitschrift 141(1), 25\u201331 (1975)","DOI":"10.1007\/BF01236981"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Lapointe, M.: Perfectly clustering words are primitive positive elements of the free group. In: Combinatorics on Words, Lecture Notes in Computer Science, pp. 117\u2013128. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85088-3_10","DOI":"10.1007\/978-3-030-85088-3_10"},{"key":"10_CR13","unstructured":"Lapointe, M., Reutenauer, C.: Characterizations of perfectly clustering words (2024). https:\/\/arxiv.org\/pdf\/2407.19140.pdf"},{"key":"10_CR14","unstructured":"Lothaire, M.: Algebraic combinatorics on words. Encyclopedia of Mathematics and its Applications, vol. 90. Cambridge University Press, Cambridge (2002)"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: An extension of the Burrows-Wheeler Transform. Theor. Comput. Sci. 387, 298\u2013312 (2007)","DOI":"10.1016\/j.tcs.2007.07.014"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Mantaci, S., Restivo, A., Sciortino, M.: Burrows-Wheeler transform and Sturmian words. Inf. Process. Lett. 86(5), 241\u2013246 (2003)","DOI":"10.1016\/S0020-0190(02)00512-4"},{"issue":"5","key":"10_CR17","first-page":"1009","volume":"168","author":"VI Oseledec","year":"1966","unstructured":"Oseledec, V.I.: The spectrum of ergodic automorphisms. Dokl. Akad. Nauk SSSR 168(5), 1009\u20131011 (1966)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Rauzy, G.: Changes d\u2019intervalles et transformations induites. Acta Arithmetica, XXXIV(4), 315\u2013328 (1979)","DOI":"10.4064\/aa-34-4-315-328"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Simpson, J., Puglisi, S.J.: Words with simple Burrows-Wheeler transforms. Electron. J. Comb. 15(R83) (2008)","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-031-97548-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T01:21:19Z","timestamp":1776820879000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97548-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031975479","9783031975486"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97548-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"30 June 2025","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":"Nancy","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwords2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/words2025.loria.fr\/en\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}