www-ai.cs.tu-dortmund.de/LEHRE/SEMINARE/SS09/AKTARBEITENDESDM/LITERATUR/FrequentStringMining.pdf
lcp(T D1 SA[p(i)−1]...n1
, T D2 i ...n2
) = LCP[p(i)], lcp(T D2 i ...n2
, T D1 SA[p(i)]...n1
) = ms(i)
(2) lcp(T D1 SA[p(i)−1]...n1
, T D2 i ...n2
) = ms(i), lcp(T D2 i ...n2
, T D1 SA[p(i)]...n1
) = LCP[p(i)] [...] /JPEG /ColorACSImageDict << /QFactor 0.76 /HSamples [2 1 1 2] /VSamples [2 1 1 2] >> /ColorImageDict << /QFactor 0.76 /HSamples [2 1 1 2] /VSamples [2 1 1 2] >> /JPEG2000ColorACSImageDict << /TileWidth 256 [...] to T D2 j ...n2
. Since φ is a common
relevant substring, |φ| ≤ lcp(T D2 i ...n2
, T D1 SA[k]...n1
). From the definition of p(i) it fol-
lows that lcp(T D2 i ...n2
, T D1 SA[k]...n1
) ≤ lcp(T D2 i ...n2 …