Optimal Parsing of Strings
Parsing of strings has been suggested by Lempel and Ziv, as a tool to define the complexity of strings [LZ1] and to compress them [ZL1, ZL2]. Recently, they have shown that the scheme may be modified to handle two dimensional data [LZ2].
KeywordsData Compression Vertex Versus Reference Tree Suffix Tree Input String
Unable to display preview. Download preview PDF.
- LZ1] A. Lempel and J. Ziv, “Compression of Two Dimensional Data”, submitted to IEEE Trans. Inf. Theory.Google Scholar
- [Wa]R.A. Wagner, “Common Phrases and Minimum-Space Text Storage”, CACM 16, 3 (March 1973), 148–152.Google Scholar
- [We]P. Weiner, “Linear Pattern Matching Algorithm”, IEEE 14th Annual Symposium on Switching and Automata Theory, (October 1973), 1–11.Google Scholar