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].

中文翻译：

---

最长的先前重叠因子数组

在本文中，我们介绍了字符串中最长的先前重叠因子数组–最长的先前因子数组的变体。我们表明，通过减少曼哈顿天际线问题的最大变量Crochemore等，可以在输入字符串的长度上以线性时间计算出它。（2014）[5]。