Suffixient arrays: a new efficient suffix array compression technique
From MaRDI portal
Cites work
- A universal algorithm for sequential data compression
- Approximate String Matching Using a Bidirectional Index
- At the roots of dictionary compression: string attractors
- b-move: faster bidirectional character extensions in a run-length compressed index
- Block trees
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Faster entropy-bounded compressed suffix trees
- Fingerprints in compressed strings
- Fully functional suffix trees and optimal text searching in BWT-runs bounded space
- How to find long maximal exact matches and ignore short ones
- scientific article; zbMATH DE number 432779 (Why is no real title available?)
- scientific article; zbMATH DE number 7051248 (Why is no real title available?)
- scientific article; zbMATH DE number 2230164 (Why is no real title available?)
- scientific article; zbMATH DE number 7651154 (Why is no real title available?)
- Kings, name days, lazy servants and magic
- On compressing and indexing repetitive sequences
- Opportunistic data structures with applications
- Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
- Optimal lower and upper bounds for representing sequences
- Optimal-time queries on BWT-runs compressed indexes
- Random access to grammar-compressed strings and trees
- Refining the \(r\)-index
- Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval
- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
- Space/time trade-offs in hash coding with allowable errors
- Suffix Arrays: A New Method for On-Line String Searches
- Wheeler maps
This page was built for publication: Suffixient arrays: a new efficient suffix array compression technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7397044)
