A Fully Linear-Time Approximation Algorithm for Grammar-Based Compression

DOI10.1007/3-540-44888-8_25zbMath1279.68375OpenAlexW1607796946MaRDI QIDQ3550846

Hiroshi Sakamoto

Publication date: 6 April 2010

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2324/3054

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Approximation algorithms (68W25) Algorithms on strings (68W32)

Related Items (1)

A fully linear-time approximation algorithm for grammar-based compression

This page was built for publication: A Fully Linear-Time Approximation Algorithm for Grammar-Based Compression