{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T01:33:49Z","timestamp":1780623229975,"version":"3.54.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032052278","type":"print"},{"value":"9783032052285","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-05228-5_6","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:00:41Z","timestamp":1758474041000},"page":"54-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Prefix-Free Parsing for\u00a0Merging Big BWTs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9071-0254","authenticated-orcid":false,"given":"Diego","family":"D\u00edaz-Dom\u00ednguez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3689-327X","authenticated-orcid":false,"given":"Travis","family":"Gagie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8888-9243","authenticated-orcid":false,"given":"Veronica","family":"Guerrini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2437-1976","authenticated-orcid":false,"given":"Ben","family":"Langmead","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3233-0691","authenticated-orcid":false,"given":"Zsuzsanna","family":"Lipt\u00e1k","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5047-0196","authenticated-orcid":false,"given":"Giovanni","family":"Manzini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2078-6835","authenticated-orcid":false,"given":"Francesco","family":"Masillo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1424-3711","authenticated-orcid":false,"given":"Vikram","family":"Shivakumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,9,22]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, O., et\u00a0al.: Pan-genomic matching statistics for targeted nanopore sequencing. iScience 24(6) (2021)","DOI":"10.1016\/j.isci.2021.102696"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1186\/s13059-023-02958-1","volume":"24","author":"OY Ahmed","year":"2023","unstructured":"Ahmed, O.Y., Rossi, M., Gagie, T., Boucher, C., Langmead, B.: SPUMONI 2: improved classification using a pangenome index of minimizer digests. Genome Biol. 24(1), 122 (2023)","journal-title":"Genome Biol."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Boucher, C., Cenzato, D., Lipt\u00e1k, Z., Rossi, M., Sciortino, M.: Computing the original eBWT faster, simpler, and with less memory. In: Proceedings 28th Symposium on String Processing and Information Retrieval (SPIRE), pp. 129\u2013142 (2021)","DOI":"10.1007\/978-3-030-86692-1_11"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Boucher, C., et\u00a0al.: PFP compressed suffix trees. In: Proceedings 23rd Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 60\u201372 (2021)","DOI":"10.1137\/1.9781611976472.5"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13015-019-0148-5","volume":"14","author":"C Boucher","year":"2019","unstructured":"Boucher, C., Gagie, T., Kuhnle, A., Langmead, B., Manzini, G., Mun, T.: Prefix-free parsing for building big BWTs. Algorithms Mol. Biol. 14, 1\u201315 (2019)","journal-title":"Algorithms Mol. Biol."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Boucher, C., Gagie, T., Kuhnle, A., Manzini, G.: Prefix-free parsing for building big BWTs. In: Proceedings 18th Workshop on Algorithms in Bioinformatics (WABI), pp. 2:1\u20132:16 (2018)","DOI":"10.1101\/472399"},{"key":"6_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2023.105088","volume":"294","author":"D D\u00edaz-Dom\u00ednguez","year":"2023","unstructured":"D\u00edaz-Dom\u00ednguez, D., Navarro, G.: Efficient construction of the BWT for repetitive text using string compression. Inf. Comput. 294, 105088 (2023)","journal-title":"Inf. Comput."},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/s00453-011-9535-0","volume":"63","author":"P Ferragina","year":"2012","unstructured":"Ferragina, P., Gagie, T., Manzini, G.: Lightweight data indexing and compression in external memory. Algorithmica 63(3), 707\u2013730 (2012)","journal-title":"Algorithmica"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Ferro, E., Oliva, M., Gagie, T., Boucher, C.: Building a pangenome alignment index via recursive prefix-free parsing. iScience 27(10) (2024)","DOI":"10.1016\/j.isci.2024.110933"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Gagie, T.I.T., Manzini, G., Navarro, G., Sakamoto, H., Takabatake, Y.: Rpair: rescaling RePair with Rsync. In: Brisaboa, N.R., Puglisi, S.J. (eds.) SPIRE 2019. LNCS, vol. 11811, pp. 35\u201344. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32686-9_3","DOI":"10.1007\/978-3-030-32686-9_3"},{"key":"6_CR11","unstructured":"Gagie, T., Manzini, G.: Prefix-free parsing for building big BWTs. arxiv (2018)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Gagie, T., Navarro, G., Prezza, N.: Optimal-time text indexing in BWT-runs bounded space. In: Proceedings 29th Symposium on Discrete Algorithms (SODA), pp. 1459\u20131477 (2018)","DOI":"10.1137\/1.9781611975031.96"},{"issue":"1","key":"6_CR13","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":"6_CR14","unstructured":"Goga, A., Bal\u00e1\u017e, A.: Prefix-free parsing for building large tunnelled Wheeler graphs. In: Proceedings 22nd Workshop on Algorithms in Bioinformatics (WABI 2022), pp. 18:1\u201318:12 (2022)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Hong, A., Rossi, M., Boucher, C.: LZ77 via prefix-free parsing. In: Proceedings 25th Symposium on Algorithm Engineering and Experiments (ALENEX), pp. 123\u2013134 (2023)","DOI":"10.1137\/1.9781611977561.ch11"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Hunt, M., et al.: AllTheBacteria - all bacterial genomes assembled, available and searchable. bioRxiv (2024)","DOI":"10.1101\/2024.03.08.584059"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Kim, J., Varki, R., Oliva, M., Boucher, C.: Re$$^2$$pair: increasing the scalability of RePair by decreasing memory usage. In: Proceedings 32nd European Symposium on Algorithms (ESA), pp. 78\u20131 (2024)","DOI":"10.1101\/2024.07.11.603142"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Li, H.: BWT construction and search at the terabase scale. Bioinformatics 40(12), btae717 (2024)","DOI":"10.1093\/bioinformatics\/btae717"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Lipt\u00e1k, Z., Luc\u00e0, S., Masillo, F.: Measuring genomic data with PFP. bioRxiv (2025)","DOI":"10.1101\/2025.02.21.639270"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"M\u00e4kinen, V., Belazzougui, D., Cunial, F., Tomescu, A.I.: Genome-Scale Algorithm Design: Bioinformatics in the Era of High-Throughput Sequencing, 2nd edn. Cambridge University Press (2023)","DOI":"10.1017\/9781009341257"},{"issue":"3","key":"6_CR21","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.tcs.2007.07.014","volume":"387","author":"S Mantaci","year":"2007","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: An extension of the Burrows-Wheeler transform. Theoret. Comput. Sci. 387(3), 298\u2013312 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR22","unstructured":"Masillo, F.: Matching statistics speed up BWT construction. In: Proceedings 31st European Symposium on Algorithms (ESA), pp. 83:1\u201383:15 (2023)"},{"key":"6_CR23","unstructured":"Olbrich, J.: Fast and memory-efficient BWT construction of repetitive texts using Lyndon grammars. arXiv (2025)"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Olbrich, J., B\u00fcchler, T., Ohlebusch, E.: Generating multiple alignments on a pangenomic scale. Bioinformatics 41(3), btaf104 (2025)","DOI":"10.1093\/bioinformatics\/btaf104"},{"issue":"2","key":"6_CR25","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1089\/cmb.2021.0290","volume":"29","author":"M Rossi","year":"2022","unstructured":"Rossi, M., Oliva, M., Langmead, B., Gagie, T., Boucher, C.: MONI: a pangenomic index for finding maximal exact matches. J. Comput. Biol. 29(2), 169\u2013187 (2022)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"6_CR26","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1186\/s13059-025-03644-0","volume":"26","author":"VS Shivakumar","year":"2025","unstructured":"Shivakumar, V.S., Langmead, B.: Mumemto: efficient maximal matching across pangenomes. Genome Biol. 26(1), 169 (2025)","journal-title":"Genome Biol."},{"key":"6_CR27","unstructured":"Tridgell, A., Mackerras, P.: The Rsync algorithm. Technical report, TR-CS-96-05, The Australian National University (1996)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-05228-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:00:44Z","timestamp":1758474044000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-05228-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,22]]},"ISBN":["9783032052278","9783032052285"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-05228-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,22]]},"assertion":[{"value":"22 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"8 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/spire-2025\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}