An online algorithm for lightweight grammar-based compression

DOI10.3390/a5020214zbMath1461.68080OpenAlexW2489658791MaRDI QIDQ1736509

Masayuki Takeda, Hiroshi Sakamoto, Shirou Maruyama

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a5020214

zbMATH Keywords

approximation algorithmonline algorithmlossless compressiongrammar-based compression

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (4)

LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding ⋮ siEDM: an efficient string index and search algorithm for edit distance with moves ⋮ General Document Retrieval in Compact Space ⋮ A Space-Optimal Grammar Compression.

This page was built for publication: An online algorithm for lightweight grammar-based compression