Algorithm 1 Dynamic Time Warping

$DTW\Leftarrow array[0\dots n,0\dots m]$ for$i=0\dots n$do  $DTW[i,0]\Leftarrow infinity$ end for for$j=0\dots m$do  $DTW[0,j]\Leftarrow infinity$ end for $DTW[0,0]\Leftarrow 0$ for$i=0\dots n$do  for $j=0\dots m$ do   $cost\Leftarrow \left|\right|\left(s\right[i]-t[j\left]\right)\left|\right|$   $DTW[i,j]\Leftarrow cost+min\left(DTW\right[i-1,j],DTW[i,j-1],DTW[i-1,j-1\left]\right)$  end for end for return$DTW[n,m]$