I agree. For this module, it not relevant that it's written in Perl.
Longest common subsequence is also abbreviated LCS, and String::LCS is not currently used.
Update: And of course, that's not the problem you are solving. It does go to show that LCSS is a bad choice anyway.
| Algorithm::LCSS::LCSS | Longuest common subsequence |
| String::LCSS::lcss | Longuest common substring |
| Algorithm::Diff::LCS | Longuest common subsequence |
String::LCSubstr?
In reply to Re^3: A better implementation of LCSS?
by ikegami
in thread A better implementation of LCSS?
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |