Succinct indexes for strings, binary relations and multi-labeled trees
From MaRDI portal
Recommendations
Cited in
(27)- The range 1 query (R1Q) problem
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations
- Stronger Lempel-Ziv based compressed text indexing
- Succinct representation of labeled graphs
- Semi-dynamic compact index for short patterns and succinct van Emde Boas tree
- Fast construction of wavelet trees
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
- Succinct indexes for strings, binary relations and multilabeled trees
- Succinct posets
- A Uniform Approach Towards Succinct Representation of Trees
- On the Size of Succinct Indices
- Succinct Representations of Arbitrary Graphs
- Optimal trade-offs for succinct string indexes
- Colored range queries and document retrieval
- Succinct encoding of arbitrary graphs
- Advanced indexing operations on substitution trees
- Recent developments in floorplan representations
- Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents
- Succinct Representation of Labeled Graphs
- Theory and Applications of Models of Computation
- scientific article; zbMATH DE number 7765406 (Why is no real title available?)
- Random access in persistent strings and segment selection
- Dynamic rank/select structures with applications to run-length encoded texts
- Rank/select on dynamic compressed sequences and applications
- A simple storage scheme for strings achieving entropy bounds
- On compact representations of all-pairs-shortest-path-distance matrices
This page was built for publication: Succinct indexes for strings, binary relations and multi-labeled trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934653)
