Cover Image

Decomposing Words for Enhanced Compression: Exploring the Number of Runs in the Extended Burrows-Wheeler Transform

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ingels, Florian, Denis, Anaïs, Cazaux, Bastien
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Discrete Mathematics Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Generalized De Bruijn Words, Invertible Necklaces, and the Burrows-Wheeler Transform
by: Fici, Gabriele, et al.
Published: (2025)

Novel Results on the Number of Runs of the Burrows-Wheeler-Transform
by: Giuliani, Sara, et al.
Published: (2020)

Morphisms and BWT-run Sensitivity
by: Fici, Gabriele, et al.
Published: (2025)

Unclustered BWTs of any Length over Non-Binary Alphabets
by: Fici, Gabriele, et al.
Published: (2025)

Wheeler Bisimulations
by: Cotumaccio, Nicola
Published: (2026)

Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space
by: Inenaga, Shunsuke, et al.
Published: (2024)

From Width-Based Model Checking to Width-Based Automated Theorem Proving
by: Oliveira, Mateus de Oliveira, et al.
Published: (2022)

Absent Subsequences in Words
by: Kosche, Maria, et al.
Published: (2021)

Constant-Time Dynamic Enumeration of Word Infixes in a Regular Language
by: Amarilli, Antoine, et al.
Published: (2026)

Bit catastrophes for the Burrows-Wheeler Transform
by: Giuliani, Sara, et al.
Published: (2024)

On the compressiveness of the Burrows-Wheeler transform
by: Bannai, Hideo, et al.
Published: (2024)

Runs in Paperfolding Sequences
by: Shallit, Jeffrey
Published: (2024)

Pseudoperiodic Words and a Question of Shevelev
by: Meleshko, Joseph, et al.
Published: (2022)

A closer look at TDFA
by: Borsotti, Angelo, et al.
Published: (2022)

Maximal Closed Substrings
by: Badkobeh, Golnaz, et al.
Published: (2022)

A Fast Algorithm for Computing Prefix Probabilities
by: Nowak, Franz, et al.
Published: (2023)

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
by: Burcsi, Péter, et al.
Published: (2020)

Exponent-Strings and Their Edit Distance
by: Baek, Ingyu
Published: (2024)

Subsequences in Bounded Ranges: Matching and Analysis Problems
by: Kosche, Maria, et al.
Published: (2022)

Indexing Finite-State Automata Using Forward-Stable Partitions
by: Becker, Ruben, et al.
Published: (2024)

Efficient Matching of Some Fundamental Regular Expressions with Backreferences
by: Nogami, Taisei, et al.
Published: (2025)

$k$-Universality of Regular Languages Revisited
by: Adamson, Duncan, et al.
Published: (2025)

Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Workflow Nets
by: Prinz, Thomas M., et al.
Published: (2026)

Algorithmical Aspects of Some Bio Inspired Operations
by: Dumitran, Marius
Published: (2025)

Dynamic Membership for Regular Tree Languages
by: Amarilli, Antoine, et al.
Published: (2025)

On Minimizers of Minimum Density
by: Shur, Arseny
Published: (2025)

Prefix Trees Improve Memory Consumption in Large-Scale Continuous-Time Stochastic Models
by: Taylor, Landon, et al.
Published: (2025)

Linear Time Subsequence and Supersequence Regex Matching
by: Amarilli, Antoine, et al.
Published: (2025)

The Inverse Lyndon Array: Definition, Properties, and Linear-Time Construction
by: Negri, Pietro, et al.
Published: (2026)

Efficiently Finding All Minimal and Shortest Absent Subsequences in a String
by: Manea, Florin, et al.
Published: (2025)

Language Edit Distance & Scored Parsing: Faster Algorithms & Connection to Fundamental Graph Problems
by: Kociumaka, Tomasz, et al.
Published: (2014)

Linear-size Suffix Tries and Linear-size CDAWGs Simplified and Improved
by: Inenaga, Shunsuke
Published: (2024)

Out-of-Order Membership in Regular Languages
by: Amarilli, Antoine, et al.
Published: (2026)

Dyck Words, Pattern Avoidance, and Automatic Sequences
by: Mol, Lucas, et al.
Published: (2023)

The Smallest String Attractors of Fibonacci and Period-Doubling Words
by: Banbara, Mutsunori, et al.
Published: (2026)

A Myhill-Nerode Type Characterization of 2detLIN Languages
by: Nagy, Benedek
Published: (2025)

Specifying and Verifying the Convergence Stairs of the Collatz Program
by: Ebnenasir, Ali
Published: (2024)

State Complexity of Shifts of the Fibonacci Word
by: Moradi, Delaram, et al.
Published: (2026)

Smallest Suffixient Sets: Effectiveness, Resilience, and Calculation
by: Fujimaru, Hiroto, et al.
Published: (2025)

Complex event recognition meets hierarchical conjunctive queries
by: Pinto, Dante, et al.
Published: (2024)