A Succinct Grammar Compression
From MaRDI portal
Publication:4928576
DOI10.1007/978-3-642-38905-4_23zbMath1381.68077arXiv1304.0917OpenAlexW327921858MaRDI QIDQ4928576
Yoshimasa Takabatake, Yasuo Tabei, Hiroshi Sakamoto
Publication date: 14 June 2013
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.0917
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42) Data structures (68P05)
Related Items (5)
Grammar compressed sequences with rank/select support ⋮ Using static suffix array in dynamic application: case of text compression by longest first substitution ⋮ siEDM: an efficient string index and search algorithm for edit distance with moves ⋮ A Space-Optimal Grammar Compression. ⋮ Faster Compressed Suffix Trees for Repetitive Collections
This page was built for publication: A Succinct Grammar Compression
