View Item 

A simple algorithm for computing the Lempel-Ziv factorization

Access Status
Open access
Authors
Date
2008
Type
Conference Paper

Metadata
Show full item record
Abstract

We give a space-efficient simple algorithm for computing the Lempel?Ziv factorization ofa string. For a string of length n over an integer alphabet, it runs in O(n) time independentlyof alphabet size and uses o(n) additional space.

Citation
Crochemore, Maxime and Ilie, Lucian and Smyth, William Fennel. 2008. A simple algorithm for computing the Lempel-Ziv factorization, in Storer, J. and Marcellin, M. (ed), 18th Data Compression Conference (DCC 2008), Mar 25 2008, pp. 482-488. Utah, USA: IEEE Computer Society.
Source Title
Proceedings of the 18th data compression conference (DCC 2008)
DOI
ISBN
ISSN
Faculty
Curtin Business School
Centre for Extended Enterprises and Business Intelligence
School of Information Systems
Remarks

Copyright © 2008 IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

URI
Collection