TY - GEN
T1 - Towards Efficient Interactive Computation of Dynamic Time Warping Distance
AU - Nishi, Akihiro
AU - Nakashima, Yuto
AU - Inenaga, Shunsuke
AU - Bannai, Hideo
AU - Takeda, Masayuki
N1 - Funding Information:
Acknowledgments. This work was supported by JSPS KAKENHI Grant Numbers JP18K18002 (YN), JP17H01697 (SI), JP20H04141 (HB), JP18H04098 (MT), and JST PRESTO Grant Number JPMJPR1922 (SI).
Publisher Copyright:
© 2020, Springer Nature Switzerland AG.
PY - 2020
Y1 - 2020
N2 - The dynamic time warping (DTW) is a widely-used method that allows us to efficiently compare two time series that can vary in speed. Given two strings A and B of respective lengths m and n, there is a fundamental dynamic programming algorithm that computes the DTW distance for A and B together with an optimal alignment in time and space. In this paper, we tackle the problem of interactive computation of the DTW distance for dynamic strings, denoted, where character-wise edit operation (insertion, deletion, substitution) can be performed at an arbitrary position of the strings. Let M and N be the sizes of the run-length encoding (RLE) of A and B, respectively. We present an algorithm for that occupies space and uses time to update a compact differential representation of the DP table per edit operation, where denotes the number of cells in whose values change after the edit operation. Our method is at least as efficient as the algorithm recently proposed by Froese et al. running in time, and is faster when is smaller than which, as our preliminary experiments suggest, is likely to be the case in the majority of instances.
AB - The dynamic time warping (DTW) is a widely-used method that allows us to efficiently compare two time series that can vary in speed. Given two strings A and B of respective lengths m and n, there is a fundamental dynamic programming algorithm that computes the DTW distance for A and B together with an optimal alignment in time and space. In this paper, we tackle the problem of interactive computation of the DTW distance for dynamic strings, denoted, where character-wise edit operation (insertion, deletion, substitution) can be performed at an arbitrary position of the strings. Let M and N be the sizes of the run-length encoding (RLE) of A and B, respectively. We present an algorithm for that occupies space and uses time to update a compact differential representation of the DP table per edit operation, where denotes the number of cells in whose values change after the edit operation. Our method is at least as efficient as the algorithm recently proposed by Froese et al. running in time, and is faster when is smaller than which, as our preliminary experiments suggest, is likely to be the case in the majority of instances.
UR - http://www.scopus.com/inward/record.url?scp=85092095312&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85092095312&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-59212-7_3
DO - 10.1007/978-3-030-59212-7_3
M3 - Conference contribution
AN - SCOPUS:85092095312
SN - 9783030592110
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 27
EP - 41
BT - String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Proceedings
A2 - Boucher, Christina
A2 - Thankachan, Sharma V.
PB - Springer Science and Business Media Deutschland GmbH
T2 - 27th International Symposium on String Processing and Information Retrieval, SPIRE 2020
Y2 - 13 October 2020 through 15 October 2020
ER -