Edit Distance is a classic family of dynamic programming problems, among which Time Warp Edit Distance refines the problem with the notion of a metric and temporal elasticity. A novel Improved Time Warp Edit Distance algorithm that is both massively parallelizable and requiring only linear storage is presented. This method uses the procession of a three diagonal band to cover the original dynamic program space. Every element of the diagonal update can be computed in parallel. The core method is a feature of the TWED Longest Common Subsequence data dependence and is applicable to dynamic programs that share similar band subproblem structure. The algorithm has been implemented as a CUDA C library with Python bindings. Speedups for challenging problems are phenomenal.

中文翻译：

---

改进的时间扭曲编辑距离——线性存储器中的并行动态程序

编辑距离是动态规划问题的经典系列，其中时间扭曲编辑距离使用度量和时间弹性的概念来细化问题。提出了一种新颖的改进的时间扭曲编辑距离算法，它既可以大规模并行化，又只需要线性存储。该方法使用三个对角线带的处理来覆盖原始动态程序空间。对角线更新的每个元素都可以并行计算。核心方法是TWED最长公共子序列数据依赖性的一个特征，适用于共享相似带子问题结构的动态程序。该算法已作为带有 Python 绑定的 CUDA C 库实现。具有挑战性的问题的加速是惊人的。