laziness, impatience, and hubris | |
PerlMonks |
Re^4: Longest common substring with N mismatchesby Anonymous Monk |
on Sep 11, 2017 at 17:00 UTC ( [id://1199134]=note: print w/replies, xml ) | Need Help?? |
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).
In Section
Seekers of Perl Wisdom
|
|