LongestCommonSequencePositions
LongestCommonSequencePositions[s1,s2]
finds the longest sequence of contiguous or disjoint elements common to the strings, lists or biomolecular sequences s1 and s2 and returns their positions.
Details and Options
- LongestCommonSequencePositions[s1,s2] returns an expression of the form {pos1,pos2} where the posi specify the positions of the longest common sequence in the strings or lists si.
- For lists si, Take[si,posi] returns the longest common sequence. For strings si, StringTake[si,posi] returns the longest common contiguous or disjoint substring.
- If there are several common sequences of the same length, LongestCommonSequencePositions returns the one that begins earliest in s1.
- For strings, setting the option IgnoreCase->True makes LongestCommonSequencePositions treat lowercase and uppercase letters as equivalent, and returns the form of common sequence that occurs in s1.
Examples
open allclose allBasic Examples (3)
Options (1)
IgnoreCase (1)
By default, LongestCommonSequencePositions distinguishes lower and upper case:
Properties & Relations (1)
Find the positions of the longest common sequence of characters:
The corresponding strings coincide:
LongestCommonSequence returns those strings joined:
SequenceAlignment returns a complete representation of the common and uncommon parts:
Text
Wolfram Research (2015), LongestCommonSequencePositions, Wolfram Language function, https://reference.wolfram.com/language/ref/LongestCommonSequencePositions.html (updated 2020).
CMS
Wolfram Language. 2015. "LongestCommonSequencePositions." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2020. https://reference.wolfram.com/language/ref/LongestCommonSequencePositions.html.
APA
Wolfram Language. (2015). LongestCommonSequencePositions. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/LongestCommonSequencePositions.html