On the number of equal-letter runs of the bijective Burrows-Wheeler transform
DOI10.1016/J.TCS.2024.115004MaRDI QIDQ6658309
Zsuzsanna Lipták, Elena Biagi, Davide Cenzato, Giuseppe Romana
Publication date: 8 January 2025
Published in: Theoretical Computer Science (Search for Journal in Brave)
Fibonacci wordscombinatorics on wordsLyndon factorizationextended Burrows-Wheeler transformbijective Burrows-Wheeler transformequal-letter runrepetitiveness measure
Combinatorics on words (68R15) Measures of information, entropy (94A17) Information storage and retrieval of data (68P20) Theory of computing (68Qxx)
Cites Work
- Title not available (Why is that?)
- Novel results on the number of runs of the Burrows-Wheeler-transform
- Burrows-Wheeler transform and Sturmian words
- A combinatorial property of the Fibonacci words
- Some combinatorial properties of Sturmian words
- Sturmian words: structure, combinatorics, and their arithmetics
- Sturmian words, Lyndon words and trees
- A survey of string orderings and their application to the Burrows-Wheeler transform
- A bijective variant of the Burrows-Wheeler transform using \(V\)-order
- An extension of the Burrows-Wheeler transform
- Sensitivity of string compressors and repetitiveness measures
- On Christoffel classes
- Data compression via textual substitution
- On the Complexity of Finite Sequences
- Indexing the bijective BWT
- Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
- The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words
- Free differential calculus. IV: The quotient groups of the lower central series
- Bit catastrophes for the Burrows-Wheeler transform
This page was built for publication: On the number of equal-letter runs of the bijective Burrows-Wheeler transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6658309)
