Computing Longest Previous Factor in linear time and applications

Information Processing Letters

Volumn 106, Issue 2, 2008, Pages 75-80

  Crochemore, Maxime ^a,b   Ilie, Lucian ^c  

^a KING'S COLLEGE LONDON   (United Kingdom)

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

^c UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Analysis of algorithms; Design of algorithms; Lempel Ziv factorization; Longest common prefix; Longest previous factor; Repetitions; Runs; Strings; Suffix array

Indexed keywords

COMPUTATIONAL METHODS; FACTORIZATION; INTEGER PROGRAMMING; LINEAR PROGRAMMING;

ANALYSIS OF ALGORITHMS; DESIGN OF ALGORITHMS; LEMPEL-ZIV FACTORIZATION; LONGEST COMMON PREFIX; LONGEST PREVIOUS FACTORS; REPETITIONS; RUNS; STRINGS; SUFFIX ARRAYS;

ALGORITHMS;

EID: 39449125651     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.10.006     Document Type: Article

References (17)

1. Abouelhoda M.I., Kurtz S., and Ohlenbusch E. Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2 (2004) 53-86
2. Chen G., Puglisi S.J., and Smyth W.F. Fast and practical algorithms for computing all runs in a string. Proc. of CPM'07. Lecture Notes in Comput. Sci. vol. 4580 (July 2007), Springer, Berlin 307-315
3. Crochemore M. Transducers and repetitions. Theoret. Comput. Sci. 45 1 (1986) 63-86
4. Crochemore M., Hancart C., and Lecroq T. Algorithms on Strings (2007), Cambridge Univ. Press
5. M. Crochemore, L. Ilie, Computing local periodicities in strings, invited talk, in: AutoMathA'07, Palermo, Italy, June 2007
6. Duval J.-P., Kolpakov R., Kucherov G., Lecroq T., and Lefebvre A. Linear-time computation of local periods. Theoret. Comput. Sci. 326 1-3 (2004) 229-240
7. Farach M. Optimal suffix tree construction with large alphabets. Proc. of FOCS'97 (1997), IEEE Computer Society Press 137-143
8. Gusfield D., and Stoye J. Linear time algorithm for finding and representing all the tandem repeats in a string. J. Comput. System Sci. 69 (2004) 525-546
9. Kärkkäinen J., and Sanders P. Simple linear work suffix array construction. Proc. of ICALP'03. Lecture Notes in Comput. Sci. vol. 2719 (2003), Springer-Verlag, Berlin, Heidelberg 943-955
10. Kasai T., Lee G., Arimura H., Arikawa S., and Park K. Linear-time longest-common-prefix computation in suffix arrays and its applications. Proc. of CPM'01. Lecture Notes in Comput. Sci. vol. 2089 (2001), Springer-Verlag, Berlin 181-192
11. Kim D.K., Sim J.S., Park H., and Park K. Constructing suffix arrays in linear time. J. Discrete Algorithms 3 2-4 (2005) 126-142
12. Ko P., and Aluru S. Space efficient linear time construction of suffix arrays. J. Discrete Algorithms 3 2-4 (2005) 143-156
13. Kolpakov R., and Kucherov G. Finding maximal repetitions in a word in linear time. Proc. of FOCS'99 (1999), IEEE Computer Society Press 596-604
14. Lempel A., and Ziv J. On the complexity of finite sequences. IEEE Trans. Inform. Theory 92 1 (1976) 75-81
15. Main M.G. Detecting leftmost maximal periodicities. Discrete Appl. Math. 25 (1989) 145-153
16. Manber U., and Myers G. Suffix arrays: a new method for on-line search. SIAM J. Comput. 22 5 (1993) 935-948
17. Ziv J., and Lempel A. A universal algorithm for sequential data compression. IEEE Trans. Inform. Theory 23 3 (1977) 337-343