改进的Time Warp编辑距离--线性存储器中的并行动态程序
Improved Time Warp Edit Distance -- A Parallel Dynamic Program in Linear Memory
摘要：
编辑距离是一类经典的动态规划问题，其中时间扭曲编辑距离通过度量和时间弹性的概念来细化问题。提出了一种新的改进的时间扭曲编辑距离算法，该算法既具有大规模并行性，又只需要线性存储。该方法利用一个三对角带的处理来覆盖原动态程序空间。对角线更新的每个元素可以并行计算。核心方法是TWED最长公共子序列数据依赖的一个特征，并且适用于共享相似带子问题结构的动态程序。该算法已实现为具有Python绑定的CUDA C库。对于具有挑战性的问题的加速是惊人的。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
