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