finds the longest contiguous subsequence of elements common to the strings or lists s1 and s2.
Details and Options
- If there are several common subsequences of the same length, LongestCommonSubsequence returns the one that appears earliest in s1.
- For strings, setting the option IgnoreCase->True makes LongestCommonSubsequence treat lowercase and uppercase letters as equivalent, and return the form of common subsequence that occurs in s1.
Introduced in 2008