Semi-dynamic compact index for short patterns and succinct van Emde Boas tree
From MaRDI portal
Publication:2942273
Recommendations
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Dynamic dictionary matching and compressed suffix trees
- Compressed indexes for dynamic text collections
- Space efficient suffix trees
- Succinct indexes for strings, binary relations and multi-labeled trees
Cites work
- scientific article; zbMATH DE number 2230164 (Why is no real title available?)
- Dynamic extended suffix arrays
- Indexing text using the Ziv--Lempel trie
- Log-logarithmic worst-case range queries are possible in space theta(N)
- On-line construction of suffix trees
- Optimal On-Line Search and Sublinear Time Update in String Matching
- Suffix Arrays: A New Method for On-Line String Searches
Cited in
(1)
This page was built for publication: Semi-dynamic compact index for short patterns and succinct van Emde Boas tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942273)