Efficient Computation of the Shortest Cover After Editing a String

The core message of this article is to propose an efficient algorithm to compute the shortest cover of a string after it is edited by an insertion, deletion, or substitution operation.