Kolpakov and Kucherov proposed a variant of the Lempel-Ziv factorization, called the reversed Lempel-Ziv (RLZ) factorization (Theoretical Computer Science, 410(51):5365–5373, 2009). In this paper, we present an on-line algorithm that computes the RLZ factorization of a given string w of length n in O(n log n) time using O(n log σ) bits of space, where σ ≤ n is the alphabet size. Also, we introd...

The longest common extension (LCE) problem is to preprocess a given string w of length n so that the length of the longest common prefix between suffixes of w that start at any two given positions is answered quickly. In this paper, we present a data structure of O(zτ + n τ ) words of space which answers LCE queries in O(1) time and can be built in O(n log σ) time, where 1 ≤ τ ≤ √ n is a parame...

The aim of this paper is to introduce the Lempel–Ziv permutation complexity vs permutation entropy plane as a tool to analyze time series of different nature. This two quantities make use of the Bandt and Pompe representation to quantify continuous-state time series. The strength of this plane is to combine two different perspectives to analyze a signal, one being statistic (the permutation ent...

We use the traveling front approach to derive exact asymptotic results for the statistics of the number of particles in a class of directed diffusion-limited aggregation models on a Cayley tree. We point out that some aspects of these models are closely connected to two different problems in computer science, namely, the digital search tree problem in data structures and the Lempel-Ziv algorith...

One of the key issues in practical speech processing is to locate precisely endpoints of the input utterance to be free of nonspeech regions. Although lots of studies have been performed to solve this problem, the operation of existing voice activity detection (VAD) algorithms is still far away from ideal. This paper proposes a novel robust feature for VAD method that is based on multi-valued c...

We model an ATM virtual circuit as a tandem queueing system. At each queue, transmission of the virtual circuit traac is interrupted by cross traf-c, causing the scattering and coalescing of cells. We study this phenomenon using entropy as a traf-c descriptor. We compute the entropy of traac streams produced in simulation, via an estimation technique based on the Lempel-Ziv universal data compr...

This paper presents the comparison of compression algorithms for voice transferring method over SMS in satellite communication. Voice transferring method over SMS is useful in situations when signal strength is low and due to poor signal strength voice call connection is not possible to initiate or signal dropped during voice call. This method has one serious flaw that it produces large number ...

Columnar Oriented Database is an enhance approach to service to service the needs of Business Intelligence. A Columnar Oriented Database Management system that stores content by columns rather than the row. This type of data differs from traditional database with regards to performance, storage requirements and easy to modification of the schema. One of the major advantage of column based datab...

The Fixed-Database version of the Lempel Ziv algorithm closely resembles many versions that appear in practice. In this paper, we ascertain several key asymptotic properties of the algorithm as applied to sources with nite memory. First, we determine that for a dictionary of size n, the algorithm achieves a redundancy n = H log log n log n + o(log log n log n), where H is the entropy of the pro...