Logarithmic equal-letter runs for BWT of purely morphic words
From MaRDI portal
Publication:2163991
DOI10.1007/978-3-031-05578-2_11OpenAlexW4285175725MaRDI QIDQ2163991
Ilaria Mancini, Giuseppe Romana, Andrea Frosini, Marinella Sciortino, Simone Rinaldi
Publication date: 11 August 2022
Full work available at URL: https://arxiv.org/abs/2202.02609
Related Items (3)
A new class of string transformations for compressed text indexing ⋮ Bit catastrophes for the Burrows-Wheeler transform ⋮ String attractors and infinite words
Cites Work
- Unnamed Item
- Unnamed Item
- Novel results on the number of runs of the Burrows-Wheeler-transform
- Burrows-Wheeler transform and Sturmian words
- Words with simple Burrows-Wheeler transforms
- Subword complexities of various classes of deterministic developmental languages without interactions
- Complexity and special factors
- Measuring the clustering effect of BWT via RLE
- Burrows-Wheeler transform and run-length enconding
- On stricter reachable repetitiveness measures
- Burrows-Wheeler transform and palindromic richness
- Burrows-Wheeler transform of words defined by morphisms
- Composite Repetition-Aware Data Structures
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- The Lempel–Ziv Complexity of Fixed Points of Morphisms
- Indexing compressed text
- Decidability of periodicity for infinite words
- Optimal-Time Dictionary-Compressed Indexes
- Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
- At the roots of dictionary compression: string attractors
This page was built for publication: Logarithmic equal-letter runs for BWT of purely morphic words
