{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:17:22Z","timestamp":1760203042182,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031332630"},{"type":"electronic","value":"9783031332647"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-33264-7_8","type":"book-chapter","created":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:03:26Z","timestamp":1684397006000},"page":"86-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Bit Catastrophes for\u00a0the\u00a0Burrows-Wheeler Transform"],"prefix":"10.1007","author":[{"given":"Sara","family":"Giuliani","sequence":"first","affiliation":[]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[]},{"given":"Zsuzsanna","family":"Lipt\u00e1k","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Romana","sequence":"additional","affiliation":[]},{"given":"Marinella","family":"Sciortino","sequence":"additional","affiliation":[]},{"given":"Cristian","family":"Urbina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,19]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"104999","DOI":"10.1016\/j.ic.2022.104999","volume":"291","author":"T Akagi","year":"2023","unstructured":"Akagi, T., Funakoshi, M., Inenaga, S.: Sensitivity of string compressors and repetitiveness measures. Inf. Comput. 291, 104999 (2023)","journal-title":"Inf. Comput."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tcs.2019.08.005","volume":"812","author":"H Bannai","year":"2020","unstructured":"Bannai, H., Gagie, T.: Refining the r-index. Theor. Comput. Sci. 812, 96\u2013108 (2020)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1051\/ita:2005038","volume":"40","author":"J Borel","year":"2006","unstructured":"Borel, J., Reutenauer, C.: On Christoffel classes. RAIRO Theor. Inf. Appl. 40(1), 15\u201327 (2006)","journal-title":"RAIRO Theor. Inf. Appl."},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-030-25005-8_32","volume-title":"Combinatorial Algorithms","author":"S Brlek","year":"2019","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"},{"key":"8_CR5","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Technical report, DIGITAL System Research Center (1994)"},{"issue":"38\u201339","key":"8_CR6","doi-asserted-by":"publisher","first-page":"3414","DOI":"10.1016\/j.tcs.2010.05.025","volume":"411","author":"G Castiglione","year":"2010","unstructured":"Castiglione, G., Restivo, A., Sciortino, M.: On extremal cases of Hopcroft\u2019s algorithm. Theoret. Comput. Sci. 411(38\u201339), 3414\u20133422 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0304-3975(96)00310-6","volume":"183","author":"A de Luca","year":"1997","unstructured":"de Luca, A.: Sturmian words: structure, combinatorics, and their arithmetics. Theor. Comput. Sci. 183(1), 45\u201382 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0304-3975(94)00035-H","volume":"136","author":"A de Luca","year":"1994","unstructured":"de Luca, A., Mignosi, F.: Some combinatorial properties of Sturmian words. Theor. Comput. Sci. 136(2), 361\u2013385 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR9","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: FOCS, pp. 390\u2013398. IEEE Computer Society (2000)"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Frosini, A., Mancini, I., Rinaldi, S., Romana, G., Sciortino, M.: Logarithmic equal-letter runs for BWT of purely morphic words. In: Diekert, V., Volkov, M. (eds.) Developments in Language Theory. DLT 2022. Lecture Notes in Computer Science, vol. 13257, pp. 139\u2013151. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-05578-2_11","DOI":"10.1007\/978-3-031-05578-2_11"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Gagie, T., Navarro, G., Prezza, N.: Optimal-time text indexing in BWT-runs bounded space. In: Czumaj, A. (ed.) SODA, pp. 1459\u20131477. SIAM (2018)","DOI":"10.1137\/1.9781611975031.96"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3375890","volume":"67","author":"T Gagie","year":"2020","unstructured":"Gagie, T., Navarro, G., Prezza, N.: Fully functional suffix trees and optimal text searching in BWT-runs bounded space. J. ACM 67(1), 1\u201354 (2020)","journal-title":"J. ACM"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-030-67731-2_18","volume-title":"SOFSEM 2021: Theory and Practice of Computer Science","author":"S Giuliani","year":"2021","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"},{"issue":"6","key":"8_CR14","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/3531445","volume":"65","author":"D Kempa","year":"2022","unstructured":"Kempa, D., Kociumaka, T.: Resolution of the burrows-wheeler transform conjecture. Commun. ACM 65(6), 91\u201398 (2022)","journal-title":"Commun. ACM"},{"issue":"2","key":"8_CR15","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D Knuth","year":"1977","unstructured":"Knuth, D., Morris, J., Jr., Pratt, V.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-030-61792-9_17","volume-title":"LATIN 2020: Theoretical Informatics","author":"T Kociumaka","year":"2020","unstructured":"Kociumaka, T., Navarro, G., Prezza, N.: Towards a definitive measure of repetitiveness. In: Kohayakawa, Y., Miyazawa, F.K. (eds.) LATIN 2021. LNCS, vol. 12118, pp. 207\u2013219. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-61792-9_17"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Lagarde, G., Perifel, S.: Lempel-Ziv: a \u201cone-bit catastrophe\u201d but not a tragedy. In: SODA, pp. 1478\u20131495. SIAM (2018)","DOI":"10.1137\/1.9781611975031.97"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Lam, T.W., Li, R., Tam, A., Wong, S., Wu, E., Yiu, S.M.: High throughput short read alignment via Bi-directional BWT. In: BIBM, pp. 31\u201336. IEEE Computer Society (2009)","DOI":"10.1109\/BIBM.2009.42"},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"R25","DOI":"10.1186\/gb-2009-10-3-r25","volume":"10","author":"B Langmead","year":"2009","unstructured":"Langmead, B., Trapnell, C., Pop, M., Salzberg, S.L.: Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol. 10(3), R25 (2009)","journal-title":"Genome Biol."},{"issue":"5","key":"8_CR20","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1093\/bioinformatics\/btp698","volume":"26","author":"H Li","year":"2010","unstructured":"Li, H., Durbin, R.: Fast and accurate long-read alignment with burrows-wheeler transform. Bioinformatics 26(5), 589\u2013595 (2010)","journal-title":"Bioinformatics"},{"key":"8_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/11496656_5","volume-title":"Combinatorial Pattern Matching","author":"V M\u00e4kinen","year":"2005","unstructured":"M\u00e4kinen, V., Navarro, G.: Succinct suffix arrays based on run-length encoding. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol. 3537, pp. 45\u201356. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496656_5"},{"key":"8_CR23","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."},{"issue":"5","key":"8_CR24","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":"2","key":"8_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3434399","volume":"54","author":"G Navarro","year":"2022","unstructured":"Navarro, G.: Indexing highly repetitive string collections, part I: repetitiveness measures. ACM Comput. Surv. 54(2), 1\u201331 (2022)","journal-title":"ACM Comput. Surv."},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-540-73208-2_36","volume-title":"Developments in Language Theory","author":"M Sciortino","year":"2007","unstructured":"Sciortino, M., Zamboni, L.Q.: Suffix automata and standard Sturmian words. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 382\u2013398. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73208-2_36"},{"key":"8_CR27","unstructured":"Seward, J.: 1996. https:\/\/sourceware.org\/bzip2\/manual\/manual.html"}],"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-33264-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:04:41Z","timestamp":1684397081000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33264-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332630","9783031332647"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33264-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 May 2023","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":"Ume\u00e5","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dltwords2023.cs.umu.se\/dlt","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":"19","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":"59% - 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":"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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4- Invited papers and 32 submissions (31 regular ones and one invited)","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)"}}]}}