Search results for "module:String::LCSS_XS"

String::LCSS_XS - Find The Longest Common Substring of Two Strings. River stage zero No dependents
++

String::LCSS_XS computes the Longest Common Substring of two strings s and t. It is a C implementation of String::LCSS and uses a dynamic programming algorithm with O(mn) runtime and O(min(m,n)) memory usage (m is the length of s and n the length of ...

LIMAONE/String-LCSS_XS-1.2 - 02 Mar 2010 20:14:45 UTC

String::LCSS - Find The Longest Common Substring of Two Strings. River stage one • 1 direct dependent • 1 total dependent
1 ++

String::LCSS provides the function "lcss" to ferret out the longest common substring shared by two strings passed as arguments....

GSULLIVAN/String-LCSS-1.00 - 01 Jan 2016 00:44:41 UTC
2 results (0.023 seconds)