Implementation is very inefficient (dynamic programming in R) –> use only on small instances
LCS(s1, s2)
s1
String one
s2
String two
String containing the longest common substring