A faster reduction of the dynamic time warping distance to the longest increasing subsequence length

DOI10.1007/S00453-022-00968-2OpenAlexW4280520465MaRDI QIDQ2165031

Shunsuke Inenaga, Yoshifumi Sakai

Publication date: 18 August 2022

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.09169

zbMATH Keywords

string algorithmslongest increasing subsequencedynamic time warping distancesemi-local sequence comparison

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Related Items (1)

Pattern matching under DTW distance

Cites Work

• Unnamed Item
• Unnamed Item
• A fast algorithm for multiplying min-sum permutations
• Semi-local string comparison: algorithmic techniques and applications
• A substring-substring LCS data structure
• Fast computation of a longest increasing subsequence and application
• A linear space algorithm for computing maximal common subsequences
• Dynamic programming algorithm optimization for spoken word recognition
• Dynamic Time Warping and Geometric Edit Distance
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation

This page was built for publication: A faster reduction of the dynamic time warping distance to the longest increasing subsequence length