Re: finding longest common substring


good chemistry is complicated, and a little bit messy -LW
	PerlMonks

by etcshadow (Priest)

on Nov 19, 2003 at 22:08 UTC ( [id://308423]=note: print w/replies, xml )

Need Help??

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

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

Comment on Re: finding longest common substring

Replies are listed 'Best First'.
Re: Re: finding longest common substring by BrowserUk (Patriarch) 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!	[reply]
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]

Domain Nodelet^?

Node Status^?

node history
Node Type: note [id://308423]
help

Chatterbox^?

How do I use this? • Last hour • Other CB clients

Other Users^?

Others exploiting the Monastery: (6)

As of 2024-04-23 18:57 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Voting Booth^?

No recent polls found