New Lower and Upper Bounds for Representing Sequences

DOI10.1007/978-3-642-33090-2_17zbMath1365.68260OpenAlexW2165602238MaRDI QIDQ2912840

Djamal Belazzougui, Gonzalo Navarro

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/144168

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (15)

Compressed string dictionary search with edit distance one ⋮ Engineering a lightweight external memory suffix array construction algorithm ⋮ Compressed Data Structures for Dynamic Sequences ⋮ GLOUDS: representing tree-like graphs ⋮ Colored range queries and document retrieval ⋮ Succinct encoding of arbitrary graphs ⋮ Wavelet trees for all ⋮ Efficient fully-compressed sequence representations ⋮ Succinct representation of labeled trees ⋮ A framework for succinct labeled ordinal trees over large alphabets ⋮ Spaces, Trees, and Colors ⋮ New space/time tradeoffs for top-\(k\) document retrieval on sequences ⋮ Fast Compressed Self-Indexes with Deterministic Linear-Time Construction ⋮ Space-efficient substring occurrence estimation ⋮ Linear-space data structures for range frequency queries on arrays and trees

This page was built for publication: New Lower and Upper Bounds for Representing Sequences