Re^2: A better implementation of LCSS?

Algorithm::LCSS's documentation says it finds the longest subsequence (axaxaxa + ayayaya = aaaaa), ~~not the longest substring, but then it compares itself to String:LCSS?!?~~ but it does indeed find the longest substring like String::LCSS.

Comment on Re^2: A better implementation of LCSS?

Replies are listed 'Best First'.
Re^3: A better implementation of LCSS? by toolic (Bishop) on Nov 16, 2015 at 21:42 UTC
Good point. When I first read through the POD, I mistakenly thought the terms "substring" and "subsequence" were synonymous. After playing around with the *::LCS modules, I realized there is a huge distinction between the terms. Perhaps the module author was under the same misconception. I agree with you that the Algorithm::LCSS POD should be clarified. UPDATE: I see you've logged a bug report.	[reply]