Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re: Re: Re: finding longest common substring

by tachyon (Chancellor)
on Nov 20, 2003 at 00:57 UTC ( [id://308462]=note: print w/replies, xml ) Need Help??


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

Here is an implementation using Algorithm::Diff directly. Re: Re: Re: LCCS time complexity

cheers

tachyon

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

In Section Seekers of Perl Wisdom

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://308462]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others learning in the Monastery: (8)
As of 2024-04-20 00:21 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found