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