Curtin University Homepage
  • Library
  • Help
    • Admin

    espace - Curtin’s institutional repository

    JavaScript is disabled for your browser. Some features of this site may not work without it.
    View Item 
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item

    A simple algorithm for computing the Lempel-Ziv factorization

    116488_A%20simple%20algorithm%20PID%20116488.pdf (226.1Kb)
    Access Status
    Open access
    Authors
    Crochemore, M.
    Ilie, L.
    Smyth, William
    Date
    2008
    Type
    Conference Paper
    
    Metadata
    Show full item record
    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)
    Source Conference
    18th Data Compression Conference (DCC 2008)
    DOI
    10.1109/DCC.2008.36
    ISBN
    9780769531212
    ISSN
    10680314
    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
    http://hdl.handle.net/20.500.11937/5907
    Collection
    • Curtin Research Publications
    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.

    Advanced search

    Browse

    Communities & CollectionsIssue DateAuthorTitleSubjectDocument TypeThis CollectionIssue DateAuthorTitleSubjectDocument Type

    My Account

    Admin

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Follow Curtin

    • 
    • 
    • 
    • 
    • 

    CRICOS Provider Code: 00301JABN: 99 143 842 569TEQSA: PRV12158

    Copyright | Disclaimer | Privacy statement | Accessibility

    Curtin would like to pay respect to the Aboriginal and Torres Strait Islander members of our community by acknowledging the traditional owners of the land on which the Perth campus is located, the Whadjuk people of the Nyungar Nation; and on our Kalgoorlie campus, the Wongutha people of the North-Eastern Goldfields.