\(r\)-indexing the eBWT
From MaRDI portal
Publication:6543261
DOI10.1016/j.ic.2024.105155MaRDI QIDQ6543261
Christina Boucher, Massimiliano Rossi, Marinella Sciortino, Zsuzsanna Lipták, Davide Cenzato
Publication date: 24 May 2024
Published in: Information and Computation (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Experimental algorithms. 15th international symposium, SEA 2016, St. Petersburg, Russia, June 5--8, 2016. Proceedings
- On compressing and indexing repetitive sequences
- LZ77 computation based on the run-length encoded BWT
- Counting permutations with given cycle structure and descent set
- r-indexing the eBWT
- Computing the original eBWT faster, simpler, and with less memory
- Refining the \(r\)-index
- On the combinatorics of suffix arrays
- From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization
- An extension of the Burrows-Wheeler transform
- Grammar-compressed indexes with logarithmic search time
- Efficient Algorithm for Circular Burrows-Wheeler Transform
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Suffix Arrays: A New Method for On-Line String Searches
- Indexing compressed text
- Permuted Longest-Common-Prefix Array
- Optimal Lower and Upper Bounds for Representing Sequences
- Indexing the bijective BWT
- Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
- Hybrid Indexing Revisited
- Two Efficient Algorithms for Linear Time Suffix Array Construction
- A theoretical and experimental analysis of BWT variants for string collections
This page was built for publication: \(r\)-indexing the eBWT
