Longest previous overlapping factor array

摘要

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]. (C) 2021 Elsevier B.V. All rights reserved.