TY - JOUR
T1 - Longest previous overlapping factor array
AU - Bannai, Hideo
AU - Inenaga, Shunsuke
AU - Mhaskar, Neerja
N1 - Funding Information:
This work was supported by JSPS KAKENHI [Grant Numbers JP16H02783 , 20H04141 (HB), JP17H01697 (SI)], and by JST PRESTO [Grant Number JPMJPR1922 (SI)].
Publisher Copyright:
© 2021 Elsevier B.V.
PY - 2021/6
Y1 - 2021/6
N2 - 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].
AB - 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].
UR - http://www.scopus.com/inward/record.url?scp=85099789911&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85099789911&partnerID=8YFLogxK
U2 - 10.1016/j.ipl.2021.106097
DO - 10.1016/j.ipl.2021.106097
M3 - Article
AN - SCOPUS:85099789911
SN - 0020-0190
VL - 168
JO - Information Processing Letters
JF - Information Processing Letters
M1 - 106097
ER -