Bit catastrophes for the Burrows-Wheeler transform

DOI10.1007/S00224-024-10212-9MaRDI QIDQ6986752zbMATH OpenFDO

Authors Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Giuseppe Romana, M. Sciortino, Cristian Urbina

Publication date 9 May 2025

Published in Theory of Computing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

sensitivityBurrows-Wheeler transformequal-letter runrepetitiveness measure

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)

This page was built for publication: Bit catastrophes for the Burrows-Wheeler transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6986752)