In Redis, the LCS
command implements the longest common subsequence algorithm.
The longest common subsequence algorithm finds the longest subsequence common to all sequences in a set of sequences. Note that this is different to the longest common string algorithm (also known as the longest common substring algorithm), which requires that matching characters in the string are contiguous. The longest common subsequence algorithm, on the other hand, doesn’t require matching characters to be contiguous.
The LCS command was introduced in Redis 7.0.0.
Continue reading →