One of the most popular encoder in the literature is the LZ78, which was proposed by Ziv and Lempel in 1978. After the original paper was published, many variants of the LZ78 were proposed to improve its performance. Simulation results have shown that the well known LZW version has an improvement around 10%. Given a sequence u ∈ A, where A is the source alphabet, all versions of LempelZiv parse...

MOTIVATION It is well known that the regulatory regions of genomes are highly repetitive. They are rich in direct, symmetric and complemented repeats, and there is no doubt about the functional significance of these repeats. Among known measures of complexity, the Ziv-Lempel complexity measure reflects most adequately repeats occurring in the text. But this measure does not take into account is...

The objective was to study changes in EEG time-domain Kolmogorov complexity under different mental fatigue state and to evaluate mental fatigue using Lempel-Ziv complexity analysis of spontaneous EEG in healthy human subjects. EEG data for healthy subjects were acquired using a net of 2 electrodes (Fp1 and Fp2) at PM 4:00, AM 12:00 and AM 3:00 in the 24 hours sleep-deprived mental fatigue exper...

the aim of this study is to evaluate how far lempel-ziv complexity (lzc) of the binary symbolic sequences resulting from static or dynamic transformation (partitioning first-order difference) of the short-term electrocardiogram (ecg) signals (only 2 seconds duration) has the  potential in discriminating normal and ventricular tachycardia/ventricular fibrillation (vt/vf) subjects. the statistica...

We address in this paper the problem of string matching on Lempel-Ziv compressed text. The goal is to search a pattern in a text without uncompressing. This is a highly relevant issue, since it is essential to have compressed text databases where eecient searching is still possible. We develop a general technique for string matching when the text comes as a sequence of blocks. This abstracts th...