Optimal Static and Dynamic Algorithms for Bounded Edit Distance with Small Integer Weights

The authors present optimal static and dynamic algorithms for computing the bounded edit distance between two strings, where the edit weights are small integers. They achieve e O(n + k2) time for the static problem and e O(k) time per update for the dynamic problem, matching the conditional lower bounds for the unweighted case.