Solving Cyclic Longest Common Subsequence in Quadratic Time

TL;DR

This paper introduces a practical quadratic-time algorithm for the cyclic longest common subsequence problem, emphasizing simplicity and ease of implementation over asymptotic improvements.

Contribution

The paper presents a new, simpler algorithm for CLCS that operates in quadratic time, making it more accessible for practical use.

Findings

Algorithm runs in O(mn) time

Simpler to understand and implement than previous methods

Provides a practical solution for CLCS

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.