A simple algorithm for computing the Lempel-Ziv factorization
| dc.contributor.author | Crochemore, M. | |
| dc.contributor.author | Ilie, L. | |
| dc.contributor.author | Smyth, William | |
| dc.contributor.editor | James A. Storer | |
| dc.contributor.editor | Michael W. Marcellin | |
| dc.date.accessioned | 2017-01-30T10:49:14Z | |
| dc.date.available | 2017-01-30T10:49:14Z | |
| dc.date.created | 2009-03-05T00:54:16Z | |
| dc.date.issued | 2008 | |
| dc.identifier.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. | |
| dc.identifier.uri | http://hdl.handle.net/20.500.11937/5907 | |
| dc.identifier.doi | 10.1109/DCC.2008.36 | |
| dc.description.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. | |
| dc.publisher | IEEE Computer Society | |
| dc.title | A simple algorithm for computing the Lempel-Ziv factorization | |
| dc.type | Conference Paper | |
| dcterms.source.startPage | 482 | |
| dcterms.source.endPage | 488 | |
| dcterms.source.issn | 10680314 | |
| dcterms.source.title | Proceedings of the 18th data compression conference (DCC 2008) | |
| dcterms.source.series | Proceedings of the 18th data compression conference (DCC 2008) | |
| dcterms.source.isbn | 9780769531212 | |
| dcterms.source.conference | 18th Data Compression Conference (DCC 2008) | |
| dcterms.source.conference-start-date | 25 Mar 2008 | |
| dcterms.source.conferencelocation | Utah, USA | |
| dcterms.source.place | USA | |
| curtin.note |
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. | |
| curtin.accessStatus | Open access | |
| curtin.faculty | Curtin Business School | |
| curtin.faculty | Centre for Extended Enterprises and Business Intelligence | |
| curtin.faculty | School of Information Systems |