Succinct indexes for strings, binary relations and multi-labeled trees

zbMATH Open1302.68097MaRDI QIDQ2934653FDOQ2934653

Authors: Jérémy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao 

Publication date: 18 December 2014

Recommendations

• Succinct indexes for strings, binary relations and multilabeled trees
• Space efficient suffix trees
• scientific article; zbMATH DE number 2230164
• On the Size of Succinct Indices
• Optimal trade-offs for succinct string indexes

Mathematics Subject Classification ID

Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cited In (27)

• Colored range queries and document retrieval
• Semi-dynamic compact index for short patterns and succinct van Emde Boas tree
• LRM-trees: compressed indices, adaptive sorting, and compressed permutations
• Recent developments in floorplan representations
• A simple storage scheme for strings achieving entropy bounds
• LRM-trees: compressed indices, adaptive sorting, and compressed permutations
• Optimal trade-offs for succinct string indexes
• Fast construction of wavelet trees
• Advanced indexing operations on substitution trees
• Dynamic rank/select structures with applications to run-length encoded texts
• Rank/select on dynamic compressed sequences and applications
• Succinct representation of labeled graphs
• Succinct posets
• The range 1 query (R1Q) problem
• Succinct encoding of arbitrary graphs
• Stronger Lempel-Ziv based compressed text indexing
• On compact representations of all-pairs-shortest-path-distance matrices
• On the Size of Succinct Indices
• Succinct Representations of Arbitrary Graphs
• Theory and Applications of Models of Computation
• Title not available (Why is that?)
• Succinct indexes for strings, binary relations and multilabeled trees
• A Uniform Approach Towards Succinct Representation of Trees
• Succinct Representation of Labeled Graphs
• Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
• Random access in persistent strings and segment selection
• Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents

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)