A fully linear-time approximation algorithm for grammar-based compression
From MaRDI portal
Publication:3550846
DOI10.1007/3-540-44888-8_25zbMATH Open1279.68375OpenAlexW1607796946MaRDI QIDQ3550846FDOQ3550846
Authors: 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
Recommendations
Approximation algorithms (68W25) Grammars and rewriting systems (68Q42) Algorithms on strings (68W32)
Cited In (12)
- Title not available (Why is that?)
- Approximation of smallest linear tree grammar
- An online algorithm for lightweight grammar-based compression
- String Processing and Information Retrieval
- Lyndon factorization of grammar compressed texts revisited
- A fully linear-time approximation algorithm for grammar-based compression
- Approximation of smallest linear tree grammar
- Approximation of grammar-based compression via recompression
- Grammar-Based Compression in a Streaming Model
- An Efficient LLL Gram Using Buffered Transformations
- Automata, Languages and Programming
- Approximation of Grammar-Based Compression via Recompression
This page was built for publication: A fully linear-time approximation algorithm for grammar-based compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3550846)
