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

Re: finding longest common substring

by etcshadow (Priest)
on Nov 19, 2003 at 22:08 UTC ( #308423=note: print w/replies, xml ) Need Help??


in reply to finding longest common substring

FYI: you might want to have a look at Algorithm::Diff, which is centered around an LCS implementation.

------------
:Wq
Not an editor command: Wq

Replies are listed 'Best First'.
Re: Re: finding longest common substring
by BrowserUk (Pope) on Nov 20, 2003 at 00:18 UTC

    Can anyone tell me how to use Algoritm::Diff::LCS to find the longest common substring of an array of strings?


    Examine what is said, not who speaks.
    "Efficiency is intelligent laziness." -David Dunham
    "Think for yourself!" - Abigail
    Hooray!
    Wanted!

      you don't -- LCS != LCSS

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (4)
As of 2020-11-30 05:46 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?