r-indexing the eBWT
From MaRDI portal
Publication:6543261
DOI10.1016/J.IC.2024.105155MaRDI QIDQ6543261FDOQ6543261
Authors: Christina Boucher, Davide Cenzato, Zsuzsanna Lipták, Massimiliano Rossi, M. Sciortino 
Publication date: 24 May 2024
Published in: Information and Computation (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Indexing compressed text
- Title not available (Why is that?)
- Counting permutations with given cycle structure and descent set
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Suffix Arrays: A New Method for On-Line String Searches
- Experimental algorithms. 15th international symposium, SEA 2016, St. Petersburg, Russia, June 5--8, 2016. Proceedings
- On compressing and indexing repetitive sequences
- Hybrid indexing revisited
- Permuted Longest-Common-Prefix Array
- Two Efficient Algorithms for Linear Time Suffix Array Construction
- An extension of the Burrows-Wheeler transform
- From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization
- On the combinatorics of suffix arrays
- Optimal lower and upper bounds for representing sequences
- LZ77 computation based on the run-length encoded BWT
- Fully functional suffix trees and optimal text searching in BWT-runs bounded space
- Title not available (Why is that?)
- r-indexing the eBWT
- Computing the original eBWT faster, simpler, and with less memory
- Refining the \(r\)-index
- Grammar-compressed indexes with logarithmic search time
- Efficient algorithm for circular Burrows-Wheeler transform
- Indexing the bijective BWT
- Title not available (Why is that?)
- A theoretical and experimental analysis of BWT variants for string collections
This page was built for publication: \(r\)-indexing the eBWT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6543261)
