Faster Binary Mean Computation Under Dynamic Time Warping

CPM, 2020.

Cited by: 0|Views30
EI

Abstract:

Many consensus string problems are based on Hamming distance. We replace Hamming distance by the more flexible (e.g., easily coping with different input string lengths) dynamic time warping distance, best known from applications in time series mining. Doing so, we study the problem of finding a mean string that minimizes the sum of (squ...More

Code:

Data:

Your rating :
0

 

Tags
Comments