Thumbnail
Access Restriction
Subscribed

Author Al-Hafeedh, Anisa ♦ Crochemore, Maxime ♦ Ilie, Lucian ♦ Kopylova, Evguenia ♦ Smyth, WF ♦ Tischler, German ♦ Yusufu, Munina
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2012
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Lempel-Ziv factorization ♦ String ♦ Algorithm ♦ Longest common prefix ♦ Periodicity ♦ Suffix array ♦ Suffix tree
Abstract Since 1977, when Lempel and Ziv described a kind of string factorization useful for text compression, there has been a succession of algorithms proposed for computing “LZ factorization”. In particular, there have been several recent algorithms proposed that extend the usefulness of LZ factorization, for example, to the calculation of maximal repetitions. In this article, we provide an overview of these new algorithms and compare their efficiency in terms of their usage of time and space.
ISSN 03600300
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2012-12-07
Publisher Place New York
e-ISSN 15577341
Journal ACM Computing Surveys (CSUR)
Volume Number 45
Issue Number 1
Page Count 17
Starting Page 1
Ending Page 17


Open content in new tab

   Open content in new tab
Source: ACM Digital Library