Re^4: Longest common substring with N mismatches

Just change what you put into @solutions. Replace

$i-$l+1
[download]

with

# Start of match in first string
# End of match in first string
[ $i-$l+1, $i+1 ]
[download]

# Start of match in first string
# End of match in first string
# Start of match in second string
# End of match in second string
[ $i-$l+1, $i+1, $j-$l+1, $j+1 ]
[download]

# Start of match in first string
# Start of match in second string
# Length of match
[ $i-$l+1, $j-$l+1, $l ]
[download]

and remove

map { substr($s, $_, $best_l) }
[download]

Comment on Re^4: Longest common substring with N mismatches Select or Download Code

Replies are listed 'Best First'.
Re^5: Longest common substring with N mismatches by leo1982 (Initiate) on Sep 13, 2017 at 08:47 UTC
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!	[reply] [d/l]
Re^6: Longest common substring with N mismatches by ikegami (Patriarch) on Sep 14, 2017 at 00:13 UTC
Not quite. "Word" and "world" have one mismatch according to that module.	[reply]