The Perl Toolchain Summit needs more sponsors. If your company depends on Perl, please support this very important event.
 / 
String-LCSS-0.12
River stage one • 1 direct dependent • 1 total dependent
1 ++
/ String::LCSS

NAME

String::LCSS - Find The Longest Common Substring of Two Strings.

SYNOPSIS

  require String::LCSS;
  my $longest = String::LCSS::lcss ( "zyzxx", "abczyzefg" );
  print $longest, "\n";

  my @result = String::LCSS::lcss ( "zyzxx", "abczyzefg" );
  print "$result[0] ($result[1],$result[2])\n";

DESCRIPTION

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.

When used in an array context, lcss will returns the indexi of the match root in the two args.

COPYRIGHT

This module is free software; you can redistribute it and/or modify it under the same terms as Perl itself.

BUGS

None presently known.

AUTHOR

Daniel Yacob, Yacob@EthiopiaOnline.Net