in reply to How do you match a stretch of at least N characters

How can a string simultaneously both match and be a mismatch? I suggest using more than one step/regex.


The way forward always starts with a minimal test.
  • Comment on Re: How do you match a stretch of at least N characters

Replies are listed 'Best First'.
Re^2: How do you match a stretch of at least N characters
by Anonymous Monk on Sep 11, 2017 at 14:03 UTC
    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?
[reply]

In Section Seekers of Perl Wisdom