Ah, Carlos, the memory required for linear algo is immense, so I'd rather say we'd drop it all.
The like suggestion made about "Permutation recovery" (n<=500 to n <= 100000) met with your
quite just disapproval on the grounds that this site is, after all, an "Archive". So thank you very much
for your concern; we'll submit a k-common substring with n_1 + ... n_k <= 100000 in one of our
contests, no doubt