Abstract
We study the computation of the Longest PreviousFactor (LPF) table which stores the maximal length of factorsoccuring at each position of a string. The Longest PreviousFactor (LPF) table is useful for data compression and stringalgorithms. This table is related to a well-known technique fordata compression, Ziv-Lempel factorization. We present analgorithm to compute the LPF table of a string from itsaugmented position heap. This algorithm can be applied for text compression and string algorithms. The algorithm is a linear time and a linear memory space.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
