<s>
Time	B-Algorithm
Warp	I-Algorithm
Edit	I-Algorithm
Distance	I-Algorithm
(	O
TWED	O
)	O
is	O
a	O
measure	O
of	O
similarity	O
(	O
or	O
dissimilarity	O
)	O
for	O
discrete	O
time	O
series	O
matching	O
with	O
time	O
'	O
elasticity	O
 '	O
.	O
</s>
<s>
DTW	O
(	O
dynamic	B-Algorithm
time	I-Algorithm
warping	I-Algorithm
)	O
or	O
LCS	O
(	O
longest	O
common	O
subsequence	O
problem	O
)	O
)	O
,	O
TWED	O
is	O
a	O
metric	O
.	O
</s>
<s>
TWED	O
is	O
also	O
implemented	O
into	O
the	O
Time	O
Series	O
Subsequence	O
Search	O
Python	B-Language
package	O
(	O
TSSEARCH	O
for	O
short	O
)	O
available	O
at	O
.	O
</s>
<s>
An	O
R	B-Language
implementation	O
of	O
TWED	O
has	O
been	O
integrated	O
into	O
the	O
TraMineR	O
,	O
a	O
R	B-Language
package	I-Language
for	O
mining	B-Application
,	O
describing	O
and	O
visualizing	O
sequences	O
of	O
states	O
or	O
events	O
,	O
and	O
more	O
generally	O
discrete	O
sequence	O
data	O
.	O
</s>
<s>
Additionally	O
,	O
is	O
a	O
CUDA	B-Architecture
-	O
accelerated	O
implementation	O
of	O
TWED	O
which	O
uses	O
an	O
improved	O
algorithm	O
due	O
to	O
G	O
.	O
Wright	O
(	O
2020	O
)	O
.	O
</s>
<s>
cuTWED	O
is	O
written	O
in	O
CUDA	B-Architecture
C/C	O
++	O
,	O
comes	O
with	O
Python	B-Language
bindings	O
,	O
and	O
also	O
includes	O
Python	B-Language
bindings	O
for	O
Marteau	O
's	O
reference	O
C	B-Language
implementation	O
.	O
</s>
<s>
Backtracking	O
,	O
to	O
find	O
the	O
most	O
cost-efficient	B-Operating_System
path	O
:	O
</s>
<s>
Backtracking	O
,	O
to	O
find	O
the	O
most	O
cost-efficient	B-Operating_System
path	O
:	O
</s>
