|Perl: the Markov chain saw|
Longest Common Substringby rkg (Hermit)
|on Apr 09, 2003 at 15:13 UTC||Need Help??|
rkg has asked for the
wisdom of the Perl Monks concerning the following question:
I am looking for a module to solve (or appoximately solve) the longest common substring problem.
I found two modules on CPAN: String-LCSS-0.10 and String-Ediff-0.01.
The first didn't download ("File not found") from CPAN; the second required a C compiler and I don't have one available (Activestate perl). Any have any suggestions?