A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A New Algorithm for the Longest Common Subsequence Problem
2007
2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)
In this paper, a robust algorithm is presented for finding similarity between two time series. The longest common subsequence (LCSS) is calculated by avoiding unnecessary comparisons. A time control parameter is introduced to prevent it from matching the 1 element of a time series with the last element of st 2 time series. Its time and space complexity is less than that of dynamic programming based algorithms nd because it stores only those elements of time series that are part of LCSS. A
doi:10.1109/cisw.2007.4425458
fatcat:6k4dwunupjfqhictcf6d7euz7y