scientific article; zbMATH DE number 6469201
From MaRDI portal
Publication:5501319
Recommendations
- When indexing equals compression, experiments with compressing suffix arrays and applications
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- New text indexing functionalities of the compressed suffix arrays
- Compressed text indexes, from theory to practice
- Time-space trade-offs for compressed suffix arrays.
- A quick tour on suffix arrays and compressed suffix arrays
- scientific article; zbMATH DE number 2089995
- A space and time efficient algorithm for constructing compressed suffix arrays
Cited in
(19)- Time-space trade-offs for Lempel-Ziv compressed indexing
- Fixed block compression boosting in FM-indexes: theory and practice
- Computation of the suffix array, Burrows-Wheeler transform and FM-index in V-order
- Compressed spaced suffix arrays
- Wavelet trees for all
- A simpler analysis of Burrows-Wheeler-based compression
- scientific article; zbMATH DE number 1615289 (Why is no real title available?)
- Locally compressed suffix arrays
- When indexing equals compression, experiments with compressing suffix arrays and applications
- Algorithms for indexing highly similar DNA sequences
- A compressed text index on secondary memory
- New text indexing functionalities of the compressed suffix arrays
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- Hybrid indexing revisited
- An experimental study of a compressed index
- String Indexing with Compressed Patterns
- Relative Lempel-Ziv Compression of Suffix Arrays
- Suffix arrays with a twist
- On compact representations of all-pairs-shortest-path-distance matrices
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501319)
