A new class of string transformations for compressed text indexing
From MaRDI portal
Publication:6053405
DOI10.1016/j.ic.2023.105068arXiv2205.05643MaRDI QIDQ6053405
Marinella Sciortino, Giovanna Rosone, Giovanni Manzini, Raffaele Giancarlo, Antonio Restivo
Publication date: 27 September 2023
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.05643
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lightweight algorithms for constructing and inverting the BWT of string collections
- A bijection between words and multisets of necklaces
- Balancing and clustering of words in the Burrows-Wheeler transform
- Counting permutations with given cycle structure and descent set
- Parallel RAM algorithms for factorizing words
- Block sorting-based transformations on words: beyond the magic BWT
- Wheeler graphs: a framework for BWT-based data structures
- Measuring the clustering effect of BWT via RLE
- Burrows-Wheeler transform and run-length enconding
- A note on the Burrows-Wheeler transformation
- Computation of the suffix array, Burrows-Wheeler transform and FM-index in \(V\)-order
- Wheeler languages
- r-indexing the eBWT
- Computing the original eBWT faster, simpler, and with less memory
- Logarithmic equal-letter runs for BWT of purely morphic words
- Refining the \(r\)-index
- Lightweight merging of compressed indices based on BWT variants
- The alternating BWT: an algorithmic perspective
- From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization
- An extension of the Burrows-Wheeler transform
- Efficient Algorithm for Circular Burrows-Wheeler Transform
- Compressed representations of sequences and full-text indexes
- Lightweight BWT Construction for Very Large String Collections
- Succinct Indexes for Circular Patterns
- The compressed permuterm index
- An analysis of the Burrows—Wheeler transform
- Most Burrows-Wheeler Based Compressors Are Not Optimal
- Boosting textual compression in optimal linear time
- Indexing compressed text
- Compression of Low Entropy Strings with Lempel--Ziv Algorithms
- Optimal Lower and Upper Bounds for Representing Sequences
- A new class of searchable and provably highly compressible string transformations
- Indexing the bijective BWT
- Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
- 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: A new class of string transformations for compressed text indexing
