 |
BUILT-IN MATHEMATICA SYMBOL
LongestCommonSubsequence
LongestCommonSubsequence[s1, s2]
finds the longest contiguous subsequence of elements common to the strings or lists 
and 
.
Details and Options
- If there are several common subsequences of the same length, LongestCommonSubsequence returns the one that appears earliest in
. - 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
.
Examplesopen all
Basic Examples (1)
Find the longest contiguous subsequence common to two strings:
| In[1]:= |
| Out[1]= |  |
New in 7
