Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

IPL
2008

favoriteEmaildiscussreport

93views more IPL 2008»

Computing Longest Previous Factor in linear time and applications

13 years 4 months ago

Computing Longest Previous Factor in linear time and applications

Download www.csd.uwo.ca

We give two optimal linear-time algorithms for computing the Longest Previous Factor (LPF) array corresponding to a string w. For any position i in w, LPF[i] gives the length of the longest factor of w starting at position i that occurs previously in w. Several properties and applications of LPF are investigated. They include computing the Lempel-Ziv factorization of a string and detecting all repetitions (runs) in a string in linear time independently of the integer alphabet size. Key words: algorithms design, strings, suffix array, longest common prefix, longest previous factor, Lempel

Maxime Crochemore, Lucian Ilie

Real-time Traffic

IPL 2008 | Longest Factor | Optimal Linear-time Algorithms | String |

claim paper

Related Content

» Visualizing 3D scenes using nonlinear projections and data mining of previous camera movem...

» Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input...

» Improving MapReduce Performance in Heterogeneous Environments

» Mining asynchronous periodic patterns in time series data

» Analysis of evolutionary algorithms for the longest common subsequence problem

» Factorization forests for infinite words and applications to countable scattered linear or...

» Interactive 3D distance field computation using linear factorization

» Fully Incremental LCS Computation

» Nondeterministic polynomial time factoring in the tile assembly model

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2008
Where	IPL
Authors	Maxime Crochemore, Lucian Ilie

Comments (0)