Linear-time off-line text compression by longest-first substitution.

DOI10.1007/B14038MaRDI QIDQ5897137zbMATH OpenOpenAlexFDO

Authors Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara

Publication date 9 February 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b14038

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) Computing methodologies for text processing; mathematical typography (68U15)

Recommendations

• Linear-time text compression by longest-first substitution
• An online algorithm for lightweight grammar-based compression
• scientific article; zbMATH DE number 1187116
• Approximation of Grammar-Based Compression via Recompression
• String Processing and Information Retrieval

Cited in

(3)

• Linear-time text compression by longest-first substitution
• scientific article; zbMATH DE number 2087041 (Why is no real title available?)
• Using static suffix array in dynamic application: case of text compression by longest first substitution

This page was built for publication: Linear-time off-line text compression by longest-first substitution.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897137)