A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
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 of both S and T. This is a classical and well-studied problem in computer science with a known O(n)-time solution. In the fully dynamic version of the problem, edit operations are allowed in either of the two strings, and we are asked to report an LCS after each such operation. We present the first solution to this problemarXiv:1804.08731v2 fatcat:6uzghlv55zbptnt7mrr4rhk7da