摘要：We consider the problem of dynamically maintaining an optimal alignment of two strings, each of length at most n, as they undergo insertions, deletions, and substitutions of letters. The string alignment problem generalizes the longest common subsequence (LCS) problem and the edit distance problem (also with non-unit costs, as long as insertions and deletions cost the same). The conditional lower bound of Backurs and Indyk [J. Comput. 2018] for computing the LCS in the static case implies that strongly sublinear update time for the dynamic string alignment problem would refute the Strong Exponential Time Hypothesis. We essentially match this lower bound when the alignment weights are constants, by showing how to process each update in ð'ªÌf(n) time. When the weights are integers bounded in absolute value by some w=n^{ð'ª(1)}, we can maintain the alignment in ð'ªÌf(n â<. min {â^S n,w}) time per update. For the ð'ªÌf(nw)-time algorithm, we heavily rely on Tiskinâs work on semi-local LCS, and in particular, in an implicit way, on his algorithm for computing the (min,+)-product of two simple unit-Monge matrices [Algorithmica 2015]. As for the ð'ªÌf(nâ^Sn)-time algorithm, we employ efficient data structures for computing distances in planar graphs.
关键词：string alignment; edit distance; longest common subsequence; (unit-)Monge matrices; (min;+)-product
