{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T10:45:15Z","timestamp":1751971515461,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030250041"},{"type":"electronic","value":"9783030250058"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-25005-8_32","type":"book-chapter","created":{"date-parts":[[2019,7,14]],"date-time":"2019-07-14T23:02:23Z","timestamp":1563145343000},"page":"393-404","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Burrows-Wheeler Transform of Words Defined by Morphisms"],"prefix":"10.1007","author":[{"given":"Srecko","family":"Brlek","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Frosini","sequence":"additional","affiliation":[]},{"given":"Ilaria","family":"Mancini","sequence":"additional","affiliation":[]},{"given":"Elisa","family":"Pergola","sequence":"additional","affiliation":[]},{"given":"Simone","family":"Rinaldi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-78909-5","volume-title":"The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching","author":"D Adjeroh","year":"2008","unstructured":"Adjeroh, D., Bell, T., Mukherjee, A.: The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching. Springer, New York (2008). https:\/\/doi.org\/10.1007\/978-0-387-78909-5"},{"key":"32_CR2","first-page":"314","volume":"42","author":"E Barcucci","year":"2004","unstructured":"Barcucci, E., B\u00e9langer, L., Brlek, S.: On Tribonacci sequences. Fibonacci Quart. 42, 314\u2013319 (2004)","journal-title":"Fibonacci Quart."},{"key":"32_CR3","unstructured":"Berstel, J.: Axel Thue\u2019s papers on repetitions in words: a translation, Publications du LaCIM 20, Montreal (1995)"},{"key":"32_CR4","unstructured":"Burrows, M., Wheeler, D.J.: A Block-Sorting Lossless Data Compression Algorithm. Digital Systems Research Center Research Reports (1995)"},{"issue":"1\u20133","key":"32_CR5","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/j.tcs.2004.11.014","volume":"332","author":"M Crochemore","year":"2005","unstructured":"Crochemore, M., D\u00e9sarm\u00e9nien, J., Perrin, D.: A note on the Burrows-Wheeler transformation. Theor. Comput. Sci. 332(1\u20133), 567\u2013572 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"32_CR6","unstructured":"Ferenczi, S., Zamboni, L.Q.: Clustering words and interval exchanges. J. Integer Sequences 16(2), Article 13.2.1 (2013)"},{"issue":"4","key":"32_CR7","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1145\/1082036.1082043","volume":"52","author":"P Ferragina","year":"2005","unstructured":"Ferragina, P., Giancarlo, R., Manzini, G., Sciortino, M.: Boosting textual compression in optimal linear time. J. ACM 52(4), 688\u2013713 (2005)","journal-title":"J. ACM"},{"issue":"2","key":"32_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0097-3165(93)90095-P","volume":"64","author":"I Gessel","year":"1993","unstructured":"Gessel, I., Reutenauer, C.: Counting permutations with given cycle structure and descent set. J. Comb. Theory Ser. A 64(2), 189\u2013215 (1993)","journal-title":"J. Comb. Theory Ser. A"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"815","DOI":"10.2307\/2371264","volume":"60","author":"GA Hedlund","year":"1938","unstructured":"Hedlund, G.A., Morse, M.: Symbolic dynamics. Am. J. Math. 60, 815\u2013866 (1938)","journal-title":"Am. J. Math."},{"issue":"3","key":"32_CR10","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.tcs.2007.07.020","volume":"387","author":"H Kaplan","year":"2007","unstructured":"Kaplan, H., Landau, S., Verbin, E.: A simpler analysis of Burrows-Wheeler based compression. Theor. Comput. Sci. 387(3), 220\u2013235 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"32_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words $$($$Encyclopedia of Mathematics and its Applications$$)$$","author":"M Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words $$($$Encyclopedia of Mathematics and its Applications$$)$$. Cambridge University Press, Cambridge (2002)"},{"key":"32_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-319-66396-8_21","volume-title":"Combinatorics on Words","author":"S Mantaci","year":"2017","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"},{"key":"32_CR13","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. Theor. Comput. Sci. 698, 79\u201387 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"32_CR14","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, 241\u2013246 (2003)","journal-title":"Inf. Process. Lett."},{"key":"32_CR15","first-page":"669","volume":"48","author":"G Manzini","year":"1999","unstructured":"Manzini, G.: An analysis of the Burrows-Wheeler transform. J. ACM (JACM) 48, 669\u2013677 (1999)","journal-title":"J. ACM (JACM)"},{"key":"32_CR16","unstructured":"OEIS Foundation Inc.: The On-line Encyclopedia of Integer Sequences (2011). http:\/\/oeis.org"},{"key":"32_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-642-02737-6_35","volume-title":"Developments in Language Theory","author":"A Restivo","year":"2009","unstructured":"Restivo, A., Rosone, G.: Balanced words having simple Burrows-Wheeler transform. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 431\u2013442. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02737-6_35"},{"issue":"27","key":"32_CR18","doi-asserted-by":"publisher","first-page":"3019","DOI":"10.1016\/j.tcs.2010.11.040","volume":"412","author":"A Restivo","year":"2011","unstructured":"Restivo, A., Rosone, G.: Balancing and clustering of words in the Burrows-Wheeler transform. Theor. Comput. Sci. 412(27), 3019\u20133032 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"30\u201332","key":"32_CR19","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. Theor. Comput. Sci. 410(30\u201332), 3018\u20133026 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"32_CR20","doi-asserted-by":"crossref","first-page":"83","DOI":"10.37236\/807","volume":"15","author":"J Simpson","year":"2008","unstructured":"Simpson, J., Puglisi, S.J.: Words with simple Burrows-Wheeler transforms. Electr. J. Comb. 15, 83 (2008)","journal-title":"Electr. J. Comb."},{"issue":"6","key":"32_CR21","doi-asserted-by":"publisher","first-page":"1703","DOI":"10.1016\/j.ejc.2006.07.007","volume":"28","author":"B Tan","year":"2007","unstructured":"Tan, B., Wen, Z.-Y.: Some properties of the Tribonacci sequence. Eur. J. Comb. 28(6), 1703\u20131719 (2007)","journal-title":"Eur. J. Comb."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25005-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:15:55Z","timestamp":1710350155000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-25005-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030250041","9783030250058"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25005-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2019.di.unipi.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":"73","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":"36","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":"49% - 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":"5-6","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}