Longest Common Substring Made Fully Dynamic

Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis +1

In the longest common substring (LCS) problem, we are given two strings $S$ and $T$, each of length at most $n$, and we are asked to find a longest string occurring as a fragment o…