Journal article
Longest previous overlapping factor array
Abstract
In this paper, we introduce the longest previous overlapping factor array of a string – a variant of the longest previous factor array. We show that it can be computed in linear time in the length of the input string, via a reduction to the Max-variant of the Manhattan skyline problem Crochemore et al. (2014) [5].
Authors
Bannai H; Inenaga S; Mhaskar N
Journal
Information Processing Letters, Vol. 168, ,
Publisher
Elsevier
Publication Date
6 2021
DOI
10.1016/j.ipl.2021.106097
ISSN
0020-0190