Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options
 
PerlMonks  

Re: Longest Common Substring

by nothingmuch (Priest)
on Apr 09, 2003 at 15:25 UTC ( [id://249250]=note: print w/replies, xml ) Need Help??


in reply to Longest Common Substring

Algorithm::Diff is probably of use. It's pure perl, and nearly every other module i found relies on it.

-nuffin
zz zZ Z Z #!perl

Replies are listed 'Best First'.
Re (2): Longest Common Substring
by VSarkiss (Monsignor) on Apr 09, 2003 at 16:08 UTC

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others studying the Monastery: (4)
As of 2024-03-28 17:04 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found