That is what I am a bit confused with. A colleague asked me if I can do that and I am still trying to figure out how this can be possible...
Ok, but how about that : how would one go in order to find all possible k-mers of the small substring that match the big one and then maybe see if they are some that are only separated by 1? Would that make sense? If yes, how do you do it? Split the small string and search it character-by-character?