Parallelism and dictionary based data compression

DOI10.1016/S0020-0255(01)00100-1zbMath1032.68658WikidataQ127125170 ScholiaQ127125170MaRDI QIDQ5944436

Sergio De Agostino

Publication date: 10 October 2001

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

Human Genome Projectsliding window

Mathematics Subject Classification ID

Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (4)

Scalability and communication in parallel low-complexity lossless compression ⋮ Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing ⋮ Lempel-Ziv data compression on parallel and distributed systems ⋮ The greedy approach to dictionary-based static text compression on a distributed system

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel construction of a suffix tree with applications
• Efficient parallel algorithms to test square-freeness and factorize strings
• P-complete problems in data compression
• An Efficient Parallel Biconnectivity Algorithm
• On the Complexity of Finite Sequences
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding

This page was built for publication: Parallelism and dictionary based data compression