2016/the-longest-common-subsequence-distance-using-a-complexity-factor
The Longest Common Subsequence Distance using a Complexity Factor
In this paper we study the classic longest common subsequence problem and we use the length of the longest common subsequence as a similarity measure between two time series. We propose an original algorithm for computing the approximate length of the LCSS that uses a discretization step, a complexity invariant factor and a dynamic threshold used for skipping the computation.
Related projects
No projects linked.
Attachments
No attachments yet.