2 papers
cs.DS2013
A Note on the Longest Common Compatible Prefix Problem for Partial Words
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka +6
For a partial word the longest common compatible prefix of two positions , denoted , is the largest such that , where $\uparr…
cs.DS2011
Efficient Seeds Computation Revisited
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos +6
The notion of the cover is a generalization of a period of a string, and there are linear time algorithms for finding the shortest cover. The seed is a more complicated generalizat…