Longest Common Subsequence (LCS)

From GM-RKB
Jump to navigation Jump to search

A Longest Common Subsequence (LCS) is a string [math]\displaystyle{ S_1 }[/math] that is in a subsequence relation with every member of string set [math]\displaystyle{ S }[/math] and with no other string [math]\displaystyle{ (S_2\in S) }[/math] in a subsequence relation with the string set is shorter than [math]\displaystyle{ S_1 }[/math].



References

2009

1975