Beefy Boxes and Bandwidth Generously Provided by pair Networks
Do you know where your variables are?
 
PerlMonks  

Re^2: How do you match a stretch of at least N characters

by Anonymous Monk
on Sep 11, 2017 at 14:03 UTC ( #1199107=note: print w/replies, xml ) Need Help??


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

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?
  • Comment on Re^2: How do you match a stretch of at least N characters

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1199107]
help
Chatterbox?
and John Coltrane plays...

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (7)
As of 2017-11-23 00:29 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    In order to be able to say "I know Perl", you must have:













    Results (327 votes). Check out past polls.

    Notices?