Package generic.algorithms
package generic.algorithms
-
ClassDescriptionLcs<T>Abstract class for finding the Longest Common Subsequence (LCS) between two sequences of Matchable objects,
x
andy
.ReducingLcs<I,T> Calculates the longest common subsequence (LCS) between two sequences of Matchable objects,x
andy
.An implementation of theReducingLcs
that takes as its input a list of <T>items, where the list is the 'sequence' being checked for the Longest Common Subsequence.