r-indexing the eBWT
From MaRDI portal
Publication:2146118
Recommendations
Cites work
- An extension of the Burrows-Wheeler transform
- Computing the original eBWT faster, simpler, and with less memory
- Counting permutations with given cycle structure and descent set
- Efficient algorithm for circular Burrows-Wheeler transform
- Fully functional suffix trees and optimal text searching in BWT-runs bounded space
- scientific article; zbMATH DE number 6850405 (Why is no real title available?)
- scientific article; zbMATH DE number 2230164 (Why is no real title available?)
- scientific article; zbMATH DE number 7695993 (Why is no real title available?)
- scientific article; zbMATH DE number 7695999 (Why is no real title available?)
- LZ77 computation based on the run-length encoded BWT
- On the combinatorics of suffix arrays
- Optimal lower and upper bounds for representing sequences
- Permuted Longest-Common-Prefix Array
- Refining the \(r\)-index
- Suffix Arrays: A New Method for On-Line String Searches
- Two Efficient Algorithms for Linear Time Suffix Array Construction
Cited in
(6)- A new class of string transformations for compressed text indexing
- Constructing and indexing the bijective and extended Burrows-Wheeler transform
- r-indexing the eBWT
- Constant time and space updates for the sigma-tau problem
- The ceBWT index: an index for circular Cartesian tree matching on multiple texts
- Extending the Burrows-Wheeler transform for Cartesian tree matching and constructing it
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 Q2146118)