Search results for "module:Algorithm::LCS"
Algorithm::LCS::XS  Fast (XS) implementation of the Longest Common Subsequence (LCS) Algorithm
CONSTRUCTOR new() Creates a new object which maintains internal storage areas for the LCS computation. Use one of these per concurrent LCS() call. METHODS line_map(@lines) Send @lines to a hashref containing elements of the form @lines entry => [(inc...
JOESUF/AlgorithmLCSXSv2.0.2  19 Sep 2022 19:31:58 UTC
Algorithm::MLCS  Fast heuristic algorithm for finding Longest Common Subsequence of multiple sequences
VMOISEEV/AlgorithmMLCS1.02

21 Dec 2012 22:04:09 UTC
Algorithm::NCS  Fast Perl extension for sequence alignment.
Number of Common Substrings (NCS)  A model and algorithm for sequence alignment. The change detection problem is aimed at identifying common and different strings and usually has nonunique solutions. The identification of the best alignment is cano...
VLD/AlgorithmNCS0.04  02 May 2018 06:52:39 UTC
Algorithm::Diff  Compute `intelligent' differences between two files / lists
RJBS/AlgorithmDiff1.201

13 Dec 2020 22:34:02 UTC
Algorithm::Diff::XS  Algorithm::Diff with XS core loop
This module is a simple repackaging of Joe Schaefer's excellent but not very wellknown Algorithm::LCS with a dropin interface that simply reuses the installed version of the Algorithm::Diff module. Note that only the "LCSidx" function is optimize...
AUDREYT/AlgorithmDiffXS0.04  24 Oct 2008 09:58:12 UTC
Algorithm::Diff::Any  Perl module to find differences between files
This is a simple module to select the best available implementation of the standard "diff" algorithm, which works by effectively trying to solve the Longest Common Subsequence (LCS) problem. This algorithm is described in: *A Fast Algorithm for Compu...
JAWNSY/AlgorithmDiffAny1.001  23 Dec 2009 00:34:12 UTC