Abstract. We present efficient algorithms for storing past segments of a text. They are computed using two previously computed read-only arrays (SUF and LCP) ...

Abstract. We present efficient algorithms for storing past segments of a text. They are computed using two previously computed read-only arrays.

In this article, we introduce a new solution for the Longest Previous Factor (LPF) table computation. The LPF table is the table that stores the maximal length ...

Abstract. We present efficient algorithms for storing past segments of a text. They are computed using two previously computed read-only arrays.

We present efficient algorithms for storing past segments of a text. They are computed using two previously computed read-only arrays (SUF and LCP) composing ...

We present efficient algorithms for storing past segments of a text. They are computed using two previously computed read-only arrays (SUF and LCP) ...

We present efficient algorithms for storing past segments of a text. They are computed using two previously computed read-only arrays (SUF and LCP) ...

We present efficient algorithms for storing past segments of a text. They are computed using two previously computed read-only arrays (SUF and LCP) ...

authors. Crochemore, Maxime; Ilie, Lucian; Iliopoulos, Costas S; Kubica, Marcin; Rytter, Wojciech; Waleń, Tomasz. status. published. publication date. 2009 ...

... {LPF Computation Revisited}, booktitle = {IWOCA}, year = {2009}, pages = {158-169}, ee = {http://dx.doi.org/10.1007/978-3-642-10217-2_18}, crossref ...