A compression scheme allowing direct string matching on compressed binary files and its applications
暂无分享,去创建一个
[1] Gonzalo Navarro,et al. A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text , 1999, CPM.
[2] Udi Manber. A text compression scheme that allows fast searching directly in the compressed file , 1997, TOIS.
[3] Ayumi Shinohara,et al. Collage system: a unifying framework for compressed pattern matching , 2003, Theor. Comput. Sci..
[4] Gonzalo Navarro,et al. Approximate string matching on Ziv-Lempel compressed text , 2003, J. Discrete Algorithms.
[5] Pawel Gawrychowski,et al. Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic , 2011, ESA.
[6] D. Huffman. A Method for the Construction of Minimum-Redundancy Codes , 1952 .
[7] Gary Benson,et al. Efficient two-dimensional compressed matching , 1992, Data Compression Conference, 1992..
[8] Abraham Lempel,et al. Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.
[9] Abraham Lempel,et al. A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.
[10] Pawel Gawrychowski,et al. Optimal Pattern Matching in LZW Compressed Strings , 2011, TALG.
[11] Ian H. Witten,et al. Arithmetic coding for data compression , 1987, CACM.
[12] Terry A. Welch,et al. A Technique for High-Performance Data Compression , 1984, Computer.