Solving Cyclic Longest Common Subsequence in Quadratic Time
classification
💻 cs.DS
keywords
commoncycliclongestsubsequencetimealgorithmasymptoticclcs
read the original abstract
We present a practical algorithm for the cyclic longest common subsequence (CLCS) problem that runs in O(mn) time, where m and n are the lengths of the two input strings. While this is not necessarily an asymptotic improvement over the existing record, it is far simpler to understand and to implement.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.