Abstract

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 of factors re-occurring at each position of a string and this table is useful for text compression. The LPF table has the important role for computational biology, data compression and string algorithms. In this paper, we present an approach to compute the LPF table of a string from its suffix heap. The algorithm runs in linear time with linear memory space.