r-indexing the eBWT
From MaRDI portal
Publication:2146118
DOI10.1007/978-3-030-86692-1_1MaRDI QIDQ2146118
Christina Boucher, Zsuzsanna Lipták, Massimiliano Rossi, Davide Cenzato, Marinella Sciortino
Publication date: 15 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-86692-1_1
68P20: Information storage and retrieval of data
68U15: Computing methodologies for text processing; mathematical typography
68W32: Algorithms on strings
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- LZ77 computation based on the run-length encoded BWT
- Counting permutations with given cycle structure and descent set
- Computing the original eBWT faster, simpler, and with less memory
- Refining the \(r\)-index
- On the combinatorics of suffix arrays
- An extension of the Burrows-Wheeler transform
- Efficient Algorithm for Circular Burrows-Wheeler Transform
- Suffix Arrays: A New Method for On-Line String Searches
- Permuted Longest-Common-Prefix Array
- Optimal Lower and Upper Bounds for Representing Sequences
- Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
- Two Efficient Algorithms for Linear Time Suffix Array Construction