Lempel Ziv Computation in Small Space (LZ-CISS)
نویسندگان
چکیده
For both the Lempel Ziv 77and 78-factorization we propose algorithms generating the respective factorization using (1 + ǫ)n lg n+O(n) bits (for any positive constant ǫ ≤ 1) working space (including the space for the output) for any text of size n over an integer alphabet in O ( n/ǫ )
منابع مشابه
Eecient Algorithms for Lempel-ziv Encoding
We consider several basic problems for texts and show that if the input texts are given by their Lempel-Ziv codes then the problems can be solved deterministically in polynomial time in the case when the original (uncompressed) texts are of exponential size. The growing importance of massively stored information requires new approaches to algorithms for compressed texts without decompressing. D...
متن کاملLinear Time Lempel-Ziv Factorization: Simple, Fast, Small
Computing the LZ factorization (or LZ77 parsing) of a string is a computational bottleneck in many diverse applications, including data compression, text indexing, and pattern discovery. We describe new linear time LZ factorization algorithms, some of which require only 2n log n + O(log n) bits of working space to factorize a string of length n. These are the most space efficient linear time al...
متن کاملAutomata on Lempel-ziv Compressed Strings
Using the Lempel-Ziv-78 compression algorithm to compress a string yields a dictionary of substrings, i.e. an edge-labelled tree with an order-compatible enumeration, here called an LZ-trie. Queries about strings translate to queries about LZ-tries and hence can in principle be answered without decompression. We compare notions of automata accepting LZ-tries and consider the relation between ac...
متن کاملLempel-Ziv complexity analysis of local field potentials in different vigilance states with different coarse-graining techniques
Analysis of electrophysiological signals recorded from the brain with Lempel-Ziv (LZ) complexity, a measure based on coarse-graining of the signal, can provide valuable insights into understanding brain activity. LZ complexity of local field potential signals recorded from the neocortex of 11 adult male Wistar-Kyoto rats in different vigilance states – waking, non-rapid-eye movement (NREM) and ...
متن کاملOn the Size of Lempel-Ziv and Lyndon Factorizations
Lyndon factorization and Lempel-Ziv (LZ) factorization are both important tools for analysing the structure and complexity of strings, but their combinatorial structure is very different. In this paper, we establish the first direct connection between the two by showing that while the Lyndon factorization can be bigger than the non-overlapping LZ factorization (which we demonstrate by describin...
متن کامل