“…We can now illustrate how to obtain a minimum-distance warp path with an example. Given X = (1,2,4,3,5,3,2,3,2,5) that represents a query series and Y = (1,1,2,4,3,5,3,2,3,2) which represents a reference series, we can construct a cost matrix D. The minimum-distance of a warp path is traced through the matrix constituents from D(1,1) to D(M,N), highlighted in pink, as shown in Fig. 3.…”