Longest previous overlapping factor array

[1]  Wojciech Rytter.  Application of Lempel-Ziv factorization to the approximation of grammar-based compression , 2003, Theor. Comput. Sci..

[2]  Wojciech Rytter,et al.  Extracting powers and periods in a word from its runs structure , 2014, Theor. Comput. Sci..

[3]  Lucian Ilie,et al.  Computing Longest Previous Factor in linear time and applications , 2008, Inf. Process. Lett..

[4]  Wojciech Rytter,et al.  Efficient algorithms for three variants of the LPF table , 2012, J. Discrete Algorithms.

[5]  Gregory Kucherov,et al.  Finding maximal repetitions in a word in linear time , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[6]  Wojciech Rytter,et al.  Computing the Longest Previous Factor , 2013, Eur. J. Comb..

[7]  Kazuya Tsuruta,et al.  The "Runs" Theorem , 2017, SIAM J. Comput..

[8]  Abraham Lempel,et al.  A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[9]  Maxime Crochemore,et al.  Computing Longest Previous non-overlapping Factors , 2011, Inf. Process. Lett..