Document Open Access Logo

Merging RLBWTs Adaptively

Author Travis Gagie

PDF

File

Thumbnail PDF
PDF
LIPIcs.CPM.2026.16.pdf
  • Filesize: 0.63 MB
  • 15 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Pattern matching
Keywords
  • Burrows-Wheeler Transform
  • run-length compression
  • RLBWT
  • construction
  • merging

Metrics

Abstract

We show how to merge two run-length compressed Burrows-Wheeler Transforms (RLBWTs) into a run-length compressed extended Burrows-Wheeler Transform (eBWT) in O (r) space and O ((r + L) log (m + n)) time, where m and n are the lengths of the uncompressed strings, r is the number of runs in the final eBWT and L is the sum of its irreducible LCP values.

Cite As Get BibTex

Travis Gagie. Merging RLBWTs Adaptively. In 37th Annual Symposium on Combinatorial Pattern Matching (CPM 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 369, pp. 16:1-16:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.CPM.2026.16

Author Details

Travis Gagie
  • Faculty of Computer Science, Dalhousie University, Halifax, Canada

Funding

Funded by NSERC Discovery Grant RGPIN-07185-2020.

References

  1. Anas Alhadi. Personal communication, 2026. Google Scholar
  2. Hideo Bannai, Travis Gagie, and Tomohiro I. Refining the r-index. Theoretical Computer Science, 812, 2020. URL: https://doi.org/10.1016/J.TCS.2019.08.005.
  3. Nico Bertram, Johannes Fischer, and Lukas Nalbach. Move-r: Optimizing the r-index. In Proceedings of the 22nd Symposium on Experimental Algorithms (SEA), 2024. URL: https://doi.org/10.4230/LIPIcs.SEA.2024.1.
  4. Christina Boucher, Travis Gagie, Alan Kuhnle, Ben Langmead, Giovanni Manzini, and Taher Mun. Prefix-free parsing for building big BWTs. Algorithms for Molecular Biology, 14, 2019. URL: https://doi.org/10.1186/S13015-019-0148-5.
  5. Nathaniel K. Brown. BWT-runs compressed data structures for pan-genomics text indexing. Mcs thesis, Dalhousie University, 2023. Google Scholar
  6. Nathaniel K. Brown, Travis Gagie, and Massimiliano Rossi. RLBWT tricks. In Proceedings of the 20th Symposium on Experimental Algorithms (SEA), 2022. URL: https://doi.org/10.4230/LIPIcs.SEA.2022.16.
  7. Nathaniel K. Brown and Ben Langmead. Bounding the average move structure query for faster and smaller RLBWT permutations. In Proceedings of the 24th Symposium on Experimental Algorithms (SEA), 2026. Google Scholar
  8. Michael Burrows and David J. Wheeler. A block-sorting lossless data compression algorithm. Technical report, Digital Equipment Corporation, 1994. Google Scholar
  9. Diego Díaz-Domínguez, Travis Gagie, Veronica Guerrini, Ben Langmead, Zsuzsanna Lipták, Giovanni Manzini, Francesco Masillo, and Vikram Shivakumar. Prefix-free parsing for merging big BWTs. In Proceedings of the 32nd Symposium on String Processing and Information Retrieval (SPIRE), 2025. Google Scholar
  10. Richard Durbin. Efficient haplotype matching and storage using the positional Burrows-Wheeler transform (PBWT). Bioinformatics, 30, 2014. URL: https://doi.org/10.1093/BIOINFORMATICS/BTU014.
  11. Paolo Ferragina, Travis Gagie, and Giovanni Manzini. Lightweight data indexing and compression in external memory. Algorithmica, 63, 2012. URL: https://doi.org/10.1007/S00453-011-9535-0.
  12. James Holt and Leonard McMillan. Merging of multi-string BWTs with applications. Bioinformatics, 30, 2014. URL: https://doi.org/10.1093/BIOINFORMATICS/BTU584.
  13. Uwaise Ibna Islam, Davide Cozzi, Travis Gagie, Rahul Varki, Vincenza Colonna, Erik Garrison, Paola Bonizzoni, and Christina Boucher. Scalable PBWT queries with minimum-length SMEM constraints. bioRxiv, 2025. Google Scholar
  14. Dominik Kempa. Optimal construction of compressed indexes for highly repetitive texts. In Proceedings of the 30th Symposium on Discrete Algorithms (SODA), 2019. Google Scholar
  15. Dominik Kempa and Tomasz Kociumaka. Resolution of the Burrows-Wheeler transform conjecture. Communications of the ACM, 65, 2022. URL: https://doi.org/10.1145/3531445.
  16. Tomasz Kociumaka, Gonzalo Navarro, and Nicola Prezza. Toward a definitive compressibility measure for repetitive sequences. IEEE Transactions on Information Theory, 69, 2022. Google Scholar
  17. Heng Li. BWT construction and search at the terabase scale. Bioinformatics, 40, 2024. Google Scholar
  18. Veli Mäkinen, Djamal Belazzougui, Fabio Cunial, and Alexandru I. Tomescu. Genome-Scale Algorithm Design: Bioinformatics in the Era of High-Throughput Sequencing. Cambridge University Press, 2nd edition, 2023. Google Scholar
  19. Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, and Marinella Sciortino. An extension of the Burrows-Wheeler transform. Theoretical Computer Science, 387, 2007. URL: https://doi.org/10.1016/J.TCS.2007.07.014.
  20. Gonzalo Navarro. Compact Data Structures: A Practical Approach. Cambridge University Press, 2016. Google Scholar
  21. Takaaki Nishimoto and Yasuo Tabei. Optimal-time queries on BWT-runs compressed indexes. In Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP), 2021. URL: https://doi.org/10.4230/LIPIcs.ICALP.2021.101.
  22. Tatsuya Ohno, Kensuke Sakai, Yoshimasa Takabatake, Tomohiro I, and Hiroshi Sakamoto. A faster implementation of online RLBWT and its application to LZ77 parsing. Journal of Discrete Algorithms, 52, 2018. Google Scholar
  23. Marco Oliva, Massimiliano Rossi, Jouni Sirén, Giovanni Manzini, Tamer Kahveci, Travis Gagie, and Christina Boucher. Efficiently merging r-indexes. In Proceedings of the 31st Data Compression Conference (DCC), 2021. Google Scholar
  24. Jouni Sirén. Burrows-Wheeler transform for terabases. In Proceedings of the 26th Data Compression Conference (DCC), 2016. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact