TY - JOUR
T1 - A note on the longest common compatible prefix problem for partial words
AU - Crochemore, M.
AU - Iliopoulos, C. S.
AU - Kociumaka, T.
AU - Kubica, M.
AU - Langiu, A.
AU - Radoszewski, J.
AU - Rytter, W.
AU - Szreder, B.
AU - Waleń, T.
PY - 2015/9/1
Y1 - 2015/9/1
N2 - For a partial word w the longest common compatible prefix of two positions i, j, denoted lccp(i,j), is the largest k such that w[i,i+k-1] and w[j,j+k-1] are compatible. The LCCP problem is to preprocess a partial word in such a way that any query lccp(i,j) about this word can be answered in O(1) time. We present a simple solution to this problem that works for any linearly-sortable alphabet. Our preprocessing is in time O(nμ+n), where μ is the number of blocks of holes in w.
AB - For a partial word w the longest common compatible prefix of two positions i, j, denoted lccp(i,j), is the largest k such that w[i,i+k-1] and w[j,j+k-1] are compatible. The LCCP problem is to preprocess a partial word in such a way that any query lccp(i,j) about this word can be answered in O(1) time. We present a simple solution to this problem that works for any linearly-sortable alphabet. Our preprocessing is in time O(nμ+n), where μ is the number of blocks of holes in w.
KW - Dynamic programming
KW - Longest common compatible prefix
KW - Longest common prefix
KW - Partial word
UR - http://www.scopus.com/inward/record.url?scp=84939570467&partnerID=8YFLogxK
U2 - 10.1016/j.jda.2015.05.003
DO - 10.1016/j.jda.2015.05.003
M3 - Article
AN - SCOPUS:84939570467
SN - 1570-8667
VL - 34
SP - 49
EP - 53
JO - Journal of Discrete Algorithms
JF - Journal of Discrete Algorithms
ER -