Compact suffix array
From MaRDI portal
Recommendations
Cited in
(20)- Wheeler graphs: a framework for BWT-based data structures
- Time-space trade-offs for Lempel-Ziv compressed indexing
- Time-space trade-offs for compressed suffix arrays.
- Reducing space for index implementation.
- Locally compressed suffix arrays
- Ziv Lempel compression of huge natural language data tries using suffix arrays
- Suffix Arrays on Words
- In-place update of suffix array while recoding words
- scientific article; zbMATH DE number 1998345 (Why is no real title available?)
- Trade off between compression and search times in compact suffix array
- scientific article; zbMATH DE number 2105038 (Why is no real title available?)
- On undetected redundancy in the Burrows-Wheeler transform
- Compressed compact suffix arrays
- A quick tour on suffix arrays and compressed suffix arrays
- scientific article; zbMATH DE number 2230164 (Why is no real title available?)
- An experimental study of a compressed index
- String Indexing with Compressed Patterns
- Relative Lempel-Ziv Compression of Suffix Arrays
- Suffix arrays with a twist
- Dynamic extended suffix arrays
This page was built for publication: Compact suffix array
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2723961)