2 citations · 2 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2023★ 2 cited
Efficient algorithms for enumerating maximal common subsequences of two strings
Miyuji Hirota, Yoshifumi Sakai
We propose efficient algorithms for enumerating maximal common subsequences (MCSs) of two strings. Efficiency of the algorithms are estimated by the preprocessing-time, space, and…
cs.DS2020
A faster reduction of the dynamic time warping distance to the longest increasing subsequence length
Yoshifumi Sakai, Shunsuke Inenaga
The similarity between a pair of time series, i.e., sequences of indexed values in time order, is often estimated by the dynamic time warping (DTW) distance, instead of any in the…