Succinct indexes for strings, binary relations and multilabeled trees

DOI10.1145/2000807.2000820MaRDI QIDQ3189037zbMATH OpenOpenAlexFDO

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

Publication date 9 September 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2000807.2000820

zbMATH Keywords

binary relationscompressed text indexeslabeled treesmultilabeled treesstringssuccinct data structuressuccinct indexestext indexing

Mathematics Subject Classification ID

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

Recommendations

• Succinct indexes for strings, binary relations and multi-labeled trees
• Space efficient suffix trees
• A categorization theorem on suffix arrays with applications to space efficient text indexes
• On the Size of Succinct Indices
• Combinatorial Pattern Matching

Cited in

(32)

• The function-inversion problem: barriers and opportunities
• Block trees
• Succinct non-overlapping indexing
• Succinct indices for path minimum, with applications
• A succinct data structure for self-indexing ternary relations
• Grammar compressed sequences with rank/select support
• Adaptive searching in succinctly encoded binary relations and tree-structured documents
• Succinct encodings for families of interval graphs
• Compressed string dictionary search with edit distance one
• Fully functional static and dynamic succinct trees
• General document retrieval in compact space
• From time to space: fast algorithms that yield small and fast data structures
• Random access to high-order entropy compressed text
• Succinct and Implicit Data Structures for Computational Geometry
• Succinct representations of ordinal trees
• A categorization theorem on suffix arrays with applications to space efficient text indexes
• Succinct indexes for strings, binary relations and multi-labeled trees
• Succinct Non-overlapping Indexing
• Succinct posets
• Compressed Data Structures for Dynamic Sequences
• On the Size of Succinct Indices
• Optimal trade-offs for succinct string indexes
• Compact binary relation representations with rich functionality
• Space efficient data structures for dynamic orthogonal range counting
• On compressing permutations and adaptive sorting
• Advanced indexing operations on substitution trees
• Efficient fully-compressed sequence representations
• Optimal indexes for sparse bit vectors
• Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents
• Theory and Applications of Models of Computation
• scientific article; zbMATH DE number 7765383 (Why is no real title available?)
• Enhancing generalized compressed suffix trees, with applications

This page was built for publication: Succinct indexes for strings, binary relations and multilabeled trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189037)