Incremental Calculation of Dynamic Time Warping

The Dynamic Time Warping (DTW) distance for time series allows non-linear alignments of time series to match similar patterns in time series of different lengths and or different speeds. Beside the traditional implementation of the DTW algorithm, the specialities of this package are, (1) the incremental calculation, which is specifically useful for life data streams due to computationally efficiency, (2) the vector based implementation of the traditional DTW algorithm which is faster because no matrices are allocated and is especially useful for computing distance matrices of pairwise DTW distances for many time series and (3) the combination of incremental and vector-based calculation. C++ in the heart. For details about DTW see the original paper "Dynamic programming algorithm optimization for spoken word recognition" by Sakoe and Chiba (1978) .


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


1.0.5 by Maximilian Leodolter, a month ago

Browse source code at

Authors: Maximilian Leodolter

Documentation:   PDF Manual  

GPL (>= 2) license

Imports Rcpp, RcppParallel, ggplot2, scales, parallel, stats, data.table

Suggests knitr, dtw, rmarkdown, gridExtra, testthat, dtwclust, parallelDist, microbenchmark, rucrdtw, proxy

Linking to Rcpp, RcppParallel, RcppArmadillo

System requirements: GNU make

See at CRAN