Computing longest previous factor in linear time and applications
| Citations: | 2 - 2 self |
BibTeX
@MISC{Crochemore_computinglongest,
author = {Maxime Crochemore and Lucian Ilie},
title = {Computing longest previous factor in linear time and applications},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. 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–Ziv factorization, repetitions, runs MSC: 68W05, 68W40, 68R15 1
