Succinct indexes for strings, binary relations and multilabeled trees

DOI10.1145/2000807.2000820zbMath1295.68227OpenAlexW2623433906MaRDI QIDQ3189037

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

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

stringslabeled treesbinary relationssuccinct data structurestext indexingsuccinct indexescompressed text indexesmultilabeled trees

Mathematics Subject Classification ID

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

Related Items (20)

Compressed string dictionary search with edit distance one ⋮ Succinct indices for path minimum, with applications ⋮ Compressed Data Structures for Dynamic Sequences ⋮ Succinct posets ⋮ Grammar compressed sequences with rank/select support ⋮ Succinct encodings for families of interval graphs ⋮ The function-inversion problem: barriers and opportunities ⋮ Compact binary relation representations with rich functionality ⋮ Space efficient data structures for dynamic orthogonal range counting ⋮ On compressing permutations and adaptive sorting ⋮ Unnamed Item ⋮ Block trees ⋮ Efficient fully-compressed sequence representations ⋮ Optimal indexes for sparse bit vectors ⋮ 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

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