{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:17:17Z","timestamp":1760203037761,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031055775"},{"type":"electronic","value":"9783031055782"}],"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-05578-2_11","type":"book-chapter","created":{"date-parts":[[2022,5,8]],"date-time":"2022-05-08T17:06:22Z","timestamp":1652029582000},"page":"139-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Logarithmic Equal-Letter Runs for\u00a0BWT of\u00a0Purely Morphic Words"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Frosini","sequence":"first","affiliation":[]},{"given":"Ilaria","family":"Mancini","sequence":"additional","affiliation":[]},{"given":"Simone","family":"Rinaldi","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Romana","sequence":"additional","affiliation":[]},{"given":"Marinella","family":"Sciortino","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,6]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Belazzougui, D., Cunial, F., Gagie, T., Prezza, N., Raffinot, M.: Composite repetition-aware data structures. In: Cicalese, F., Porat, E., Vaccaro, U. (eds.) CPM 2015. LNCS, vol. 9133, pp. 26\u201339. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19929-0_3","DOI":"10.1007\/978-3-319-19929-0_3"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Brlek, S., Frosini, A., Mancini, I., Pergola, E., Rinaldi, S.: Burrows-Wheeler transform of words defined by morphisms. In: Colbourn, C.J., Grossi, R., Pisanti, N. (eds.) IWOCA 2019. LNCS, vol. 11638, pp. 393\u2013404. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25005-8_32","DOI":"10.1007\/978-3-030-25005-8_32"},{"key":"11_CR3","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Technical report, DIGITAL System Research Center (1994)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Cassaigne, J.: Complexity and special factors. (complexit\u00e9 et facteurs sp\u00e9ciaux.). Bull. Belgian Math. Soc. - Simon Stevin 4(1), 67\u201388 (1997)","DOI":"10.36045\/bbms\/1105730624"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Christiansen, A.R., Ettienne, M.B., Kociumaka, T., Navarro, G., Prezza, N.: Optimal-time dictionary-compressed indexes. ACM Trans. Algorithms 17(1), 8:1\u20138:39 (2021)","DOI":"10.1145\/3426473"},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1137\/050646846","volume":"21","author":"S Constantinescu","year":"2007","unstructured":"Constantinescu, S., Ilie, L.: The Lempel-Ziv complexity of fixed points of morphisms. SIAM J. Discret. Math. 21(2), 466\u2013481 (2007)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0304-3975(75)90012-2","volume":"1","author":"A Ehrenfeucht","year":"1975","unstructured":"Ehrenfeucht, A., Lee, K.P., Rozenberg, G.: Subword complexities of various classes of deterministic developmental languages without interactions. Theor. Comput. Sci. 1(1), 59\u201375 (1975)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR8","unstructured":"Ferenczi, S., Zamboni, L.Q.: Clustering words and interval exchanges. J. Integer Seq. 16(2), Article 13.2.1 (2013)"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1145\/1082036.1082039","volume":"52","author":"P Ferragina","year":"2005","unstructured":"Ferragina, P., Manzini, G.: Indexing compressed text. J. ACM 52, 552\u2013581 (2005)","journal-title":"J. ACM"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Frosini, A., Mancini, I., Rinaldi, S., Romana, G., Sciortino, M.: Burrows-Wheeler transform on purely morphic words. In: DCC, pp. 452\u2013452. IEEE (2022)","DOI":"10.1109\/DCC52660.2022.00063"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Gagie, T., Navarro, G., Prezza, N.: Fully functional suffix trees and optimal text searching in BWT-runs bounded space. J. ACM 67(1), 2:1\u20132:54 (2020)","DOI":"10.1145\/3375890"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Giuliani, S., Inenaga, S., Lipt\u00e1k, Z., Prezza, N., Sciortino, M., Toffanello, A.: Novel results on the number of runs of the Burrows-Wheeler transform. In: Bure\u0161, T., et al. (eds.) SOFSEM 2021. LNCS, vol. 12607, pp. 249\u2013262. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67731-2_18","DOI":"10.1007\/978-3-030-67731-2_18"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Kempa, D., Kociumaka, T.: Resolution of the Burrows-Wheeler transform conjecture. In: FOCS, pp. 1002\u20131013. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00097"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Kempa, D., Prezza, N.: At the roots of dictionary compression: string attractors. In: STOC. pp. 827\u2013840. ACM (2018)","DOI":"10.1145\/3188745.3188814"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: Burrows-Wheeler transform and Run-Length Enconding. In: Brlek, S., Dolce, F., Reutenauer, C., Vandomme, \u00c9. (eds.) WORDS 2017. LNCS, vol. 10432, pp. 228\u2013239. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66396-8_21","DOI":"10.1007\/978-3-319-66396-8_21"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.tcs.2017.07.015","volume":"698","author":"S Mantaci","year":"2017","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M., Versari, L.: Measuring the clustering effect of BWT via RLE. Theoret. Comput. Sci. 698, 79\u201387 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR17","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. Inform. Process. Lett. 86, 241\u2013246 (2003)","journal-title":"Inform. Process. Lett."},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Navarro, G.: Indexing highly repetitive string collections, part I: repetitiveness measures. ACM Comput. Surv. 54(2), 29:1\u201329:31 (2021)","DOI":"10.1145\/3434399"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Navarro, G., Urbina, C.: On stricter reachable repetitiveness measures. In: Lecroq, T., Touzet, H. (eds.) SPIRE 2021. LNCS, vol. 12944, pp. 193\u2013206. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86692-1_16","DOI":"10.1007\/978-3-030-86692-1_16"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Pansiot, J.: Complexit\u00e9 des facteurs des mots infinis engendr\u00e9s par morphimes it\u00e9r\u00e9s. In: ICALP. Lecture Notes Computer Science, vol. 172, pp. 380\u2013389. Springer (1984)","DOI":"10.1007\/3-540-13345-3_34"},{"issue":"1","key":"11_CR21","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1051\/ita\/1986200100431","volume":"20","author":"JJ Pansiot","year":"1986","unstructured":"Pansiot, J.J.: Decidability of periodicity for infinite words. RAIRO - Theor. Inform. Appl. 20(1), 43\u201346 (1986)","journal-title":"RAIRO - Theor. Inform. Appl."},{"issue":"30\u201332","key":"11_CR22","doi-asserted-by":"publisher","first-page":"3018","DOI":"10.1016\/j.tcs.2009.03.008","volume":"410","author":"A Restivo","year":"2009","unstructured":"Restivo, A., Rosone, G.: Burrows-Wheeler transform and palindromic richness. Theoret. Comput. Sci. 410(30\u201332), 3018\u20133026 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR23","unstructured":"Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Elsevier Science (1980)"},{"key":"11_CR24","unstructured":"Seward, J.: The bzip2 home page (2006). http:\/\/www.bzip.org"},{"key":"11_CR25","unstructured":"Shaeffer, L., Shallit, J.: String attractors for automatic sequences. CoRR abs\/2012.06840 (2020)"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Simpson, J., Puglisi, S.J.: Words with simple Burrows-Wheeler transforms. Electron. J. Combin. 15 (article R83) (2008)","DOI":"10.37236\/807"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-05578-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T17:30:26Z","timestamp":1675531826000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-05578-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031055775","9783031055782"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-05578-2_11","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":"6 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tampa, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"9 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.usf.edu\/arts-sciences\/conferences\/dlt2022\/","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":"32","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":"21","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":"66% - 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)"}}]}}