LCS - Longest Common Subsequence River stage one • 3 direct dependents • 3 total dependents

LCS is an implementation based on the traditional LCS algorithm. It contains reference implementations working slow but correct. Also some utility methods are added to reformat the result. CONSTRUCTOR new() Creates a new object which maintains intern...

WOLLMERS/LCS-0.11 - 25 Nov 2016 07:51:42 GMT

LCS::Tiny - Tiny implementation of the Longest Common Subsequence (LCS) Algorithm River stage one • 3 direct dependents • 3 total dependents

CONSTRUCTOR new() Creates a new object which maintains internal storage areas for the LCS computation. Use one of these per concurrent LCS() call. METHODS LCS(\@a,\@b) Finds a Longest Common Subsequence, taking two arrayrefs as method arguments. It r...

WOLLMERS/LCS-0.11 - 25 Nov 2016 07:51:42 GMT

2 results (0.048 seconds)