Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re^4: Longest common substring with N mismatches

by ikegami (Patriarch)
on Sep 12, 2017 at 15:51 UTC ( [id://1199214]=note: print w/replies, xml ) Need Help??


in reply to Re^3: Longest common substring with N mismatches
in thread Longest common substring with N mismatches

Just change what you put into @solutions. Replace

$i-$l+1

with

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

or

# 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 ]

or

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

and remove

map { substr($s, $_, $best_l) }

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!

      Not quite. "Word" and "world" have one mismatch according to that module.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://1199214]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others chilling in the Monastery: (3)
As of 2024-04-18 19:52 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found