Sublinear Algorithms for Approximating String Compressibility

DOI10.1007/978-3-540-74208-1_44MaRDI QIDQ3603498zbMATH OpenOpenAlexFDO

Authors

Publication date 17 February 2009

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/73520

Mathematics Subject Classification ID

Approximation algorithms (68W25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Sublinear algorithms for approximating string compressibility
• Substring compression problems
• Adaptive learning of compressible strings
• Generalized substring compression
• scientific article; zbMATH DE number 2119662

Cited in

(8)

• scientific article; zbMATH DE number 1490000 (Why is no real title available?)
• NC algorithms for finding a maximal set of paths with application to compressing strings
• Upper bounds on distinct maximal (sub-)repetitions in compressed strings
• Sublinear algorithms for approximating string compressibility
• At the roots of dictionary compression: string attractors
• Substring complexities on run-length compressed strings
• Adaptive learning of compressible strings
• CONCUR 2003 - Concurrency Theory

This page was built for publication: Sublinear Algorithms for Approximating String Compressibility

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