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

DOI10.1007/3-540-44888-8_25MaRDI QIDQ3550846zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

Recommendations

• A fully linear-time approximation algorithm for grammar-based compression
• String Processing and Information Retrieval
• Approximation of grammar-based compression via recompression
• Approximation of Grammar-Based Compression via Recompression
• scientific article; zbMATH DE number 2119662

Cited in

(12)

• Approximation of Grammar-Based Compression via Recompression
• scientific article; zbMATH DE number 2119662 (Why is no real title available?)
• 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

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)