Perl Monk, Perl Meditation | |
PerlMonks |
Re^5: Longest common substring with N mismatchesby leo1982 (Initiate) |
on Sep 13, 2017 at 08:47 UTC ( [id://1199275]=note: print w/replies, xml ) | Need Help?? |
Hi ikegami! Many thanks! I forgot to post it here, I think I solved my problem with the String::Approx module (since I always had just 1 mismatch). But I will try your approach as well, it seems to be more solid anyway... Many thanks again!
In Section
Seekers of Perl Wisdom
|
|