String::LCSS - Find The Longest Common Substring of Two Strings.
This document refers to String::LCSS version 1.00.
use String::LCSS; my $longest = lcss( "zyzxx", "abczyzefg" ); print $longest, "\n"; my @result = lcss( "zyzxx", "abczyzefg" ); print "$result ($result,$result)\n";
String::LCSS provides the function
lcss to ferret out the longest common substring shared by two strings passed as arguments.
undef is returned if the susbstring length is one char or less.
In scalar context, returns the substring.
When used in an array context,
lcss will return the indexi of the match root in the two args.
lcss function is exported by default.
There are no known bugs in this module.
String::LCSS_XS is not pure Perl, but it was created to be faster.
This module is free software; you can redistribute it and/or modify it under the same terms as Perl itself. See perlartistic.
The original author is Daniel Yacob (CPAN ID: DYACOB).
Gene Sullivan (email@example.com) is a co-maintainer.
Code provided by BrowserUk from PerlMonks.