Longest previous overlapping factor array

•The paper presents an algorithm to compute the Longest Previous Overlapping Factor Array (LPoF) for an input string.•The algorithm runs in linear time and space in the length of the input string.•The LPoF is a variant of the Longest Previous Factor Array (LPF).•The LPoF Array can be seen as a complement of the Longest Previous Non-overlapping Array (LPnF).•The LPF array can be trivially computed for the LPnF and LPoF Arrays together.