Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings

02/13/2023

∙

We give an Õ(n^2) time algorithm for computing the exact Dynamic Time Warping distance between two strings whose run-length encoding is of size at most n. This matches (up to log factors) the known (conditional) lower bound, and should be compared with the previous fastest O(n^3) time exact algorithm and the Õ(n^2) time approximation algorithm.

READ FULL TEXT

Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings

Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings

Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation

The One-Way Communication Complexity of Dynamic Time Warping Distance

Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality

Approximating longest common substring with k mismatches: Theory and practice

Pattern matching under DTW distance

Computing a Subtrajectory Cluster from c-packed Trajectories

Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings

Related Research

Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings

Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation

The One-Way Communication Complexity of Dynamic Time Warping Distance

Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality

Approximating longest common substring with k mismatches: Theory and practice

Pattern matching under DTW distance

Computing a Subtrajectory Cluster from c-packed Trajectories