Re: Re: finding longest common substring

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!

Comment on Re: Re: finding longest common substring

Replies are listed 'Best First'.
Re: Re: Re: finding longest common substring by tachyon (Chancellor) on Nov 20, 2003 at 00:57 UTC
Here is an implementation using Algorithm::Diff directly. Re: Re: Re: LCCS time complexity cheers tachyon	[reply]
Re^3: finding longest common substring by Anonymous Monk on Jul 21, 2009 at 04:07 UTC
you don't -- LCS != LCSS	[reply]