Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source
نویسندگان
چکیده
منابع مشابه
Average Profile of the Lempel-Ziv Parsing Scheme for Markovian Source
Jing Tang Microsoft Corporation One Microsoft Way, 1/2061 Redmond, WA 98052 U.S.A. [email protected] For a Markovian source, we analyze the Lempel-Ziv parsing scheme that partitions sequences into phrases such that a new phrase is the shortest phrase not seen in the past. We consider three models: In the Markov Independent model, several sequences are generated independently by Markovian sou...
متن کاملAverage Profile of the Lempel - Ziv Parsing Scheme for Amarkovian
For a Markovian source, we analyze the Lempel-Ziv parsing scheme that partitions sequences into phrases such that a new phrase is the shortest phrase not seen in the past. We consider three models: In the Markov Independent model, several sequences are generated independently by Markovian sources, and the ith phrase is the shortest preex of the ith sequence that was not seen before as a phrase ...
متن کاملAverage profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
Wojciech Szpankowskl* Department of Computer Science Purdue University W. Lafayette, IN 47907 U.S.A. Consider the parsing algorithm due to Lempel and Ziv that partitions a sequence of length n into variable phrases (blocks) such that a new block is the shortest substring not seen in the past as a phrase. In practice the following parameters are of interest: number of phrases, the size of a phra...
متن کاملLightweight Lempel-Ziv Parsing
We introduce a new approach to LZ77 factorization that uses O(n/d) words of working space and O(dn) time for any d ≥ 1 (for polylogarithmic alphabet sizes). We also describe carefully engineered implementations of alternative approaches to lightweight LZ77 factorization. Extensive experiments show that the new algorithm is superior in most cases, particularly at the lowest memory levels and for...
متن کاملFaster Lightweight Lempel-Ziv Parsing
We present an algorithm that computes the Lempel-Ziv decomposition in O(n(log σ+log log n)) time and n log σ+ǫn bits of space, where ǫ is a constant rational parameter, n is the length of the input string, and σ is the alphabet size. The n log σ bits in the space bound are for the input string itself which is treated as read-only.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2001
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-001-0053-3