Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Decomposing Words for Enhanced Compression: Exploring the Number of Runs in the Extended Burrows-Wheeler Transform
Florian Ingels, Anaïs Denis, Bastien Cazaux
The Burrows-Wheeler Transform (BWT) is a fundamental component in many data structures for text indexing and compression, widely used in areas such as bioinformatics and informatio…
cs.DS2024
On the number of -mers admitting a given lexicographical minimizer
Florian Ingels, Camille Marchet, Mikaël Salson
The minimizer of a word of size (a -mer) is defined as its smallest substring of size (with ), according to some ordering on -mers. minimizers have been used…