Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re: Re: Re: finding longest common substring

by tilly (Archbishop)
on Nov 20, 2003 at 06:49 UTC ( [id://308526]=note: print w/replies, xml ) Need Help??


in reply to Re: Re: finding longest common substring
in thread finding longest common substring

I guess that I had somewhat more overhead than I realized. I'll think about whether I can improve on that. :-(

Incidentally my solution compares much better than others if you make the input strings much longer than the common substrings. For instance if the common match is "The quick brown fox" and the strings are each a few hundred characters, I win by a wide margin.

  • Comment on Re: Re: Re: finding longest common substring

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others cooling their heels in the Monastery: (4)
As of 2024-04-24 12:16 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found