A New Algorithm for the Longest Common Subsequence Problem

Xuyu Xiang, Dafang Zhang, Jiaohua Qin
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
more » ... l feature of LCSS called special longest common subsequence (SLCSS) is also presented. Both algorithms were evaluated and checked over real time data sets and show excellent results for shorter as well as longer time series.
doi:10.1109/cisw.2007.4425458 fatcat:6k4dwunupjfqhictcf6d7euz7y