Re^2: 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 (Saint) on Sep 11, 2017 at 16:53 UTC
Whats wrong with the link I gave you? see also How do I post a question effectively? Cheers Rolf _{(addicted to the Perl Programming Language and ☆☆☆☆ :) Je suis Charlie!}	[reply]
Re^4: Longest common substring with N mismatches by Anonymous Monk on Sep 11, 2017 at 17:00 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).	[reply]
Re^5: Longest common substring with N mismatches by LanX (Saint) on Sep 11, 2017 at 17:05 UTC
N-mer??? Are you looking for Levenshtein distance ? If not please be so kind and provide us an example with input and desired output. Cheers Rolf _{(addicted to the Perl Programming Language and ☆☆☆☆ :) Je suis Charlie!}	[reply]
Re^6: Longest common substring with N mismatches by Anonymous Monk on Sep 11, 2017 at 17:09 UTC
Re^7: Longest common substring with N mismatches by LanX (Saint) on Sep 11, 2017 at 17:17 UTC
Re^7: Longest common substring with N mismatches by Anonymous Monk on Sep 11, 2017 at 17:14 UTC


Perl-Sensitive Sunglasses
	PerlMonks