2 citations · 2 across the 2 of their papers we have counts for
1 paper · 1 filter
Andy Nguyen
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 thi…