countPaths

Count how many possible warping paths exist in the alignment problem passed
as an argument. The object passed as an argument is used to look up the
problem parameters such as the used step pattern, windowing, open ends, and
so on. The actual alignment is ignored.

A comprehensive implementation of dynamic time warping
(DTW) algorithms in R. DTW computes the optimal (least cumulative
distance) alignment between points of two time series. Common DTW
variants covered include local (slope) and global (window)
constraints, subsequence matches, arbitrary distance definitions,
normalizations, minimum variance matching, and so on. Provides
cumulative distances, alignments, specialized plot styles, etc.,
as described in Giorgino (2009) <doi:10.18637/jss.v031.i07>.

Toni Giorgino

Dynamic Time Warping Algorithms

countPaths function

<dl><dt>d</dt>
<dd>an object of class <code>dtw</code></dd>
<dt>debug</dt>
<dd>return an intermediate result</dd></dl>

Arguments

Author

Count the number of warping paths consistent with the constraints. — countPaths

<dl>

<dt>d</dt>
<dd>an object of class <code>dtw</code></dd>


<dt>debug</dt>
<dd>return an intermediate result</dd>

</dl>

countPaths: Count the number of warping paths consistent with the constraints.

Description

Usage

Value

Arguments

Author

Details

Examples