FSMDTW: A Fast Index-free Subsequence Matching Algorithm for Dynamic Time Warping
Summary: Index-free subsequence matching under DTW accelerated by novel lower bounds and data structures that reduce per-candidate lower-bound cost from O(m) to average O(log m). FSMDTW combines these subsequence-aware bounds and pruning to achieve 2.6x–10x speedups on real and synthetic data. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Zemin Chao
- 2. Qiaoyi Zheng
- 3. Zhixin Qi
- 4. Hongzhi Wang
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,061 | Warping Indexes with Envelope Transforms for Query by Humming | 2003 | SIGMOD | 0.00014368716 |
| 3,540 | Scalable, Variable-Length Similarity Search in Data Series: The ULISSE Approach | 2018 | VLDB | 6.9943185e-05 |
| 8,778 | The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem | 2022 | VLDB | 4.4543399e-05 |
Previous
Page 1 / 1
Next