Anonymous Monk has asked for the wisdom of the Perl Monks concerning the following question:
Hi everyone!
I am in need on an implementation of the Longest-Common-Substring problem, but with one addition - that one can allow for N mis-matches. I found several threads in the Monastery, but they all seem to work for exact matches - no miscmatches allowed.
Anybody knows where to look for?
Many thanks!
I am in need on an implementation of the Longest-Common-Substring problem, but with one addition - that one can allow for N mis-matches. I found several threads in the Monastery, but they all seem to work for exact matches - no miscmatches allowed.
Anybody knows where to look for?
Many thanks!
Back to
Seekers of Perl Wisdom