prefix pairs and then backtracks to recover one optimal subsequence. The problem is in P because this dynamic programming solution runs in O(mn) time, which is polynomial in the input lengths.

Abstract: Subsequence clustering is an important issue in time series data mining. Observing that most time series consist of various patterns with different unknown lengths, we propose an ...

As for comparing items that are nodes, we probably need another parameter to indicate whether we want identity semantics or value semantics to be used in comparing the corresponding items. Also need ...