A simple algorithm for computing the Lempel-Ziv factorization

Data Compression Conference Proceedings

Volumn , Issue , 2008, Pages 482-488

  Crochemore, Maxime ^a,b   Ilie, Lucian ^c   Smyth, W F ^d,e  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b Université de Marne la Vallée   (France)

^c UNIVERSITY OF WESTERN ONTARIO   (Canada)

^d MCMASTER UNIVERSITY   (Canada)

^e CURTIN UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALPHABET-SIZE; SIMPLE ALGORITHMS;

FACTORIZATION; MICROWAVE ANTENNAS;

DATA COMPRESSION;

EID: 50249188365     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2008.36     Document Type: Conference Paper

References (23)

1. M.I. Abouelhoda, S. Kurtz, and E. Ohlenbusch, Replacing suffix trees with enhanced suffix arrays, J. Discrete Algorithms 2 (2004) 53 - 86.
2. G. Chen, S.J. Puglisi, and W.F. Smyth, Fast and practical algorithms for computing all runs in a string, Proc. of CPM'07, Lecture Notes in Comput. Sci. 4580, Springer, Berlin, 2007, 307 - 315.
3. M. Crochemore, Transducers and repetitions, Theoret. Comput. Sci. 45(1) (1986) 63 -86.
4. M. Crochemore, C. Hancart, and T. Lecroq, Algorithms on Strings, Cambridge Univ. Press, 2007.
5. M. Crochemore and L. Ilie, Computing longest previous factor in linear time and applications, Inform. Proc. Lett., to appear.
6. J.-P. Duval, R. Kolpakov, G. Kucherov, T. Lecroq, and A. Lefebvre, Linear-Time Computation of Local Periods, Theoret. Comput. Sci. 326(1-3) (2004) 229 - 240.
7. M. Farach, Optimal suffix tree construction with large alphabets, in Proc. of FOCS'97, IEEE Computer Society Press, 1997, 137 - 143.
8. F. Franek, J. Holub, W. F. Smyth and X. Xiao, Computing quasi suffix arrays, J. Automata, Languages and Combinatorics 8(4) (2003) 593-606.
9. D. Gusfield and J. Stoye, Linear Time Algorithms for Finding and Representing all the Tandem Repeats in a String, J. Comput. Syst. Sci. 69(4) (2004) 525 - 546.
10. J. Kärkkäinen and P. Sanders, Simple linear work suffix array construction, in Proc. of ICALP'03, Lecture Notes in Comput. Sci. 2719, Springer-Verlag, Berlin, Heidelberg, 2003, 943 - 955.
11. T. Kasal, G. Lee, H. Arimura, S. Arikawa, and K. Park, Linear-time longest-common-prefix computation in suffix arrays and its applications, Proc. of CPM'01, Lecture Notes in Comput. Sci. 2089, Springer-Verlag, Berlin, 2001, 181 - 192.
12. D.K. Kim, J.S. Sim, H. Park, and K. Park, Constructing suffix arrays in linear time. J. Discrete Algorithms 3(2-4) (2005) 126-142.
13. P. Ko and S. Aluru, Space efficient linear time construction of suffix arrays, J. Discrete Algorithms 3(2-4) (2005) 143 - 156.
14. R. Kolpakov and G. Kucherov, Finding maximal repetitions in a word in linear time, in: Proceedings of the 40th FOCS, IEEE Computer Society Press, New York, 1999, 596-604.
15. R. Kolpakov and G. Kucherov, On maximal repetitions in words, J. Discrete Algorithms 1(1) (2000) 159 - 186.
16. A. Lempel and J. Ziv, On the complexity of finite sequences, IEEE Trans. Inform. Theory 92(1) (1976) 75 - 81.
17. M. Lothaire, Algebraic Combinatorics on Words, Cambridge Univ. Press, 2002.
18. U. Manber and G. Myers. Suffix arrays: a new method for on-line search, SIAM J. Comput. 22(5) (1993) 935 - 948.
19. G. Manzini, Two space-saving tricks for linear-time LCP computation, in T. Hagerup & J. Katajainen (eds.) Proc. SWAT 2004, Lecture Notes in Comput. Sci. 3111 (2004) 372-383.
20. M. Rodeh, V.R. Pratt, and S. Even, Linear Algorithm for Data Compression via String Matching, J. ACM 28(1) (1981) 16 - 24.
21. J. Storer and T. Szymanski, Data compression via textual substitution, J. ACM 29(4) (1982) 928 - 951.
22. I.H. Witten, A. Moffat, and T.C. Bell, Managing Gigabytes, Van Nostrand Reinhold, New York, 1994.
23. J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Trans. Inform. Theory 23(3) (1977) 337 - 343.