|Subject:||Algorithm::LCSS finds longest substring, not longest subsequence|
Algorithm::LCSS says it finds the longest subsequence (axaxaxabcdef + ayayayabcghi = aaaaabc), but it finds the longest substring (axaxaxabcdef + ayayayabcghi = abc)
This queue is for tickets about the Algorithm-LCSS CPAN distribution.
This service is sponsored and maintained by Best Practical Solutions and runs on Perl.org infrastructure.
Please report any issues with rt.cpan.org to email@example.com.