Compressed index for a dynamic collection of texts
From MaRDI portal
Recommendations
- Compressed indexes for dynamic text collections
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Dynamic dictionary matching and compressed suffix trees
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Improved Dynamic Text Indexing
Cited in
(10)- Compressed text indexing with wildcards
- Dynamic dictionary matching and compressed suffix trees
- Compressed indexes for dynamic text collections
- Compressed Data Structures for Dynamic Sequences
- Compressed Text Indexes with Fast Locate
- (Worst-case) optimal adaptive dynamic bitvectors
- Dynamic rank/select structures with applications to run-length encoded texts
- Rank/select on dynamic compressed sequences and applications
- A compressed dynamic self-index for highly repetitive text collections
- Optimal prefix and suffix queries on texts
This page was built for publication: Compressed index for a dynamic collection of texts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315352)