Similarity-based Compression with Multidimensional Pattern Matching
Abstract
References
Index Terms
- Similarity-based Compression with Multidimensional Pattern Matching
Recommendations
Speeding Up Pattern Matching by Text Compression
CIAC '00: Proceedings of the 4th Italian Conference on Algorithms and ComplexityByte pair encoding (BPE) is a simple universal text compression scheme. Decompression is very fast and requires small work space. Moreover, it is easy to decompress an arbitrary part of the original text. However, it has not been so popular since the ...
Collection-based compression using discovered long matching strings
CIKM '11: Proceedings of the 20th ACM international conference on Information and knowledge managementMany collections of data contain items that are inherently similar. For example, archives contain files with incremental changes between releases. Long-range inter-file similarities are not exploited by standard approaches to compression. We investigate ...
Lossless compression of VLSI layout image data
We present a novel lossless compression algorithm called Context Copy Combinatorial Code (C4), which integrates the advantages of two very disparate compression techniques: context-based modeling and Lempel-Ziv (LZ) style copying. While the algorithm ...
Comments
Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Office of Advanced Scientific Computing Research Office of Science of the U.S. Department of Energy
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 222Total Downloads
- Downloads (Last 12 months)37
- Downloads (Last 6 weeks)6
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in