A faster reduction of the dynamic time warping distance to the longest increasing subsequence length (Q2165031)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster reduction of the dynamic time warping distance to the longest increasing subsequence length |
scientific article |
Statements
A faster reduction of the dynamic time warping distance to the longest increasing subsequence length (English)
0 references
18 August 2022
0 references
string algorithms
0 references
dynamic time warping distance
0 references
longest increasing subsequence
0 references
semi-local sequence comparison
0 references
0 references
