LPF computation revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5874 LNCS, Issue , 2009, Pages 158-169

  Crochemore, Maxime ^a,d   Ilie, Lucian ^b   Iliopoulos, Costas S ^a,e   Kubica, Marcin ^c   Rytter, Wojciech ^c,f   Waleń, Tomasz ^c  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

^c UNIVERSITY OF WARSAW   (Poland)

^d UNIVERSITÉ PARIS EST   (France)

^e CURTIN UNIVERSITY   (Australia)

^f NICOLAUS COPERNICUS UNIVERSITY   (Poland)

Author keywords

Detection of repetitions; Longest previous factor; Suffix array; Text compression; Ziv Lempel factorisation

Indexed keywords

DETECTION OF REPETITIONS; FACTORISATION; LONGEST PREVIOUS FACTOR; SUFFIX ARRAYS; TEXT COMPRESSIONS;

CLUSTERING ALGORITHMS; FACTORIZATION;

COMBINATORIAL MATHEMATICS;

EID: 77349097696     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10217-2_18     Document Type: Conference Paper

References (21)

1. Berstel, J., Savelli, A.: Crochemore factorization of Sturmian and other infinite words. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 157-166. Springer, Heidelberg (2006).
2. Crochemore, M.: Transducers and repetitions. Theoretical Computer Science 45(1), 63-86 (1986).
3. Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings, 392 p. Cambridge University Press, Cambridge (2007).
4. Crochemore, M., Ilie, L.: Computing Longest Previous Factor in linear time and applications. Inf. Process. Lett. 106(2), 75-80 (2008).
5. Crochemore, M., Ilie, L., Smyth, W.F.: A simple algorithm for computing the Lempel-Ziv factorization. In: Storer, J.A., Marcellin, M.W. (eds.) 18th Data Compression Conference, pp. 482-488. IEEE Computer Society, Los Alamitos (2008).
6. Crochemore, M., Rytter, W.: Jewels of Stringology, 310 p. World Scientific Publishing, Hong-Kong (2002).
7. Franek, F., Holub, J., Smyth, W.F., Xiao, X.: Computing quasi suffix arrays. Journal of Automata, Languages and Combinatorics 8(4), 593-606 (2003).
8. Nong, G., Zhang, S., Chan, W.H.: Linear Time Suffix Array Construction Using D-Critical Substrings. In: Kucherov, G., Ukkonen, E. (eds.) Combinatorial Pattern Matching. LNCS, vol. 5577, pp. 54-67. Springer, Heidelberg (2009).
9. Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology, 534 p. Cambridge University Press, Cambridge (1997).
10. Kärkkäinen, J., Sanders, P.: Simple linear work suffix array construction. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 943-955. Springer, Heidelberg (2003).
11. Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 181-192. Springer, Heidelberg (2001).
12. Kim, D.K., Sim, J.S., Park, H., Park, K.: Linear-time construction of suffix arrays. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 186-199. Springer, Heidelberg (2003).
13. Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 200-210. Springer, Heidelberg (2003).
14. Kolpakov, R.M., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: FOCS, pp. 596-604 (1999).
15. Main, M.G.: Detecting leftmost maximal periodicities. Discret. Appl. Math. 25, 145-153 (1989).
16. Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22(5), 935-948 (1993).
17. Rodeh, M., Pratt, V.R., Even, S.: Linear algorithm for data compression via string matching. J. ACM 28(1), 16-24 (1981).
18. Storer, J., Szymanski, T.: Data compression via textual substitution. J. ACM 29(4), 928-951 (1982).
19. Witten, I., Moffat, A., Bell, T.: Managing Gigabytes. Van Nostrand Reinhold, New York (1994).
20. Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory 23(3), 337-343 (1977).
21. Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory 24(5), 530-536 (1978).