Compressed indexing with signature grammars
From MaRDI portal
Publication:2294697
DOI10.1007/978-3-319-77404-6_25zbMath1485.68081arXiv1711.08217OpenAlexW2964082949MaRDI QIDQ2294697
Mikko Berggren Ettienne, Anders Roy Christiansen
Publication date: 12 February 2020
Full work available at URL: https://arxiv.org/abs/1711.08217
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) Algorithms on strings (68W32)
Related Items (5)
Document listing on repetitive collections with guaranteed performance ⋮ Grammar-compressed indexes with logarithmic search time ⋮ Dynamic index and LZ factorization in compressed space ⋮ Top tree compression of tries ⋮ A compressed dynamic self-index for highly repetitive text collections
This page was built for publication: Compressed indexing with signature grammars
