Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
 
PerlMonks  

Re^2: Longest common substring with N mismatches

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


in reply to Re: Longest common substring with N mismatches
in thread Longest common substring with N mismatches

All I am asking is if anyone knows of such a module or implementation. I read threads like 994837, 608174, 249239, 145608, but they all work with exact matching. And I was hoping that someone would perhaps know of a module or something that can allow for some mismatches instead of requiring exact matches.
  • Comment on Re^2: Longest common substring with N mismatches

Replies are listed 'Best First'.
Re^3: Longest common substring with N mismatches
by LanX (Bishop) on Sep 11, 2017 at 16:53 UTC
      I am sorry, but I can't understand if this post deals with the same issue.
      As it seems to me, the one that is asking this post needs matches of N-mers, but I was asking if there is a way to find just the longest one that would tolerate a defined number of mismatches/replacements (e.g. 1 or 2).

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1199132]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (6)
As of 2017-10-21 03:07 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My fridge is mostly full of:

















    Results (269 votes). Check out past polls.

    Notices?