Anonymous user
Longest common subsequence: Difference between revisions
→{{header|Python}}
Line 2,055:
=={{header|Python}}==
The simplest way is to use [http://mlpy.sourceforge.net/docs/3.5/lcs.html LCS within mlpy package]
===Using Indexes===
import re
s1 = "thisisatest"
s2 = "testing123testing"
longest = ""
i = 0
for x in s1:
if re.search(x, s2):
s = x
while re.search(s, s2):
if len(s)>len(longest):
longest = s
if i+len(s) == len(s1):
break
s = s1[i:i+len(s)+1]
i += 1
print longest
===Recursion===
| |||