English

Solving Cyclic Longest Common Subsequence in Quadratic Time

Data Structures and Algorithms 2012-08-17 v3
Authors: Andy Nguyen
View on arXiv ↗ PDF ↗

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.

Keywords

string algorithms

Cite

@article{arxiv.1208.0396,
  title  = {Solving Cyclic Longest Common Subsequence in Quadratic Time},
  author = {Andy Nguyen},
  journal= {arXiv preprint arXiv:1208.0396},
  year   = {2012}
}

Comments

Updated references; an O(n^2) solution already exists, though it is terribly unwieldy

Related papers

View all related →
Data Structures and Algorithms · Computer Science
Longest Common Subsequence in at Least $k$ Length Order-Isomorphic Substrings
Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka +5
2017-02-07
Data Structures and Algorithms · Computer Science
An $O(n^2)$ Algorithm for Computing Longest Common Cyclic Subsequence
Shihabur Rahman Chowdhury, Masud Hasan, Sumaiya Iqbal, M. Sohel Rahman
2010-04-20
Data Structures and Algorithms · Computer Science
Quadratic-time Algorithm for the String Constrained LCS Problem
Sebastian Deorowicz
2011-07-01
Data Structures and Algorithms · Computer Science
A Practical O(R\log\log n+n) time Algorithm for Computing the Longest Common Subsequence
Daxin Zhu, Lei Wang, Yingjie Wu, Xiaodong Wang
2015-08-25
Data Structures and Algorithms · Computer Science
Longest Common Substring and Longest Palindromic Substring in $\tilde{\mathcal{O}}(\sqrt{n})$ Time
Domenico Cantone, Simone Faro, Arianna Pavone, Caterina Viola
2023-09-06
Data Structures and Algorithms · Computer Science
New tabulation and sparse dynamic programming based techniques for sequence similarity problems
Szymon Grabowski
2014-05-22
Data Structures and Algorithms · Computer Science
Longest Common Subsequence in k-length substrings
Gary Benson, Avivit Levy, Riva Shalom
2014-02-11
Data Structures and Algorithms · Computer Science
Longest Square Subsequence Problem Revisited
Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai
2020-07-30
Data Structures and Algorithms · Computer Science
Approximating the Longest Common Subsequence problem within a sub-polynomial factor in linear time
Negev Shekel Nosatzki
2021-12-17
Data Structures and Algorithms · Computer Science
Approximating LCS in Linear Time: Beating the $\sqrt{n}$ Barrier
MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun
2020-03-17
Data Structures and Algorithms · Computer Science
Longest Common Substring Made Fully Dynamic
Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski
2018-07-17
Data Structures and Algorithms · Computer Science
A hardness result and new algorithm for the longest common palindromic subsequence problem
Shunsuke Inenaga, Heikki Hyyrö
2016-12-23
Data Structures and Algorithms · Computer Science
Faster STR-EC-LCS Computation
Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai +1
2020-01-17
Data Structures and Algorithms · Computer Science
An Efficient Dynamic Programming Algorithm for STR-IC-SEQ-EC-LCS Problem
Daxin Zhu, Lei Wang, Yingjie Wu, Xiaodong Wang
2015-06-02
Data Structures and Algorithms · Computer Science
A sub-quadratic algorithm for the longest common increasing subsequence problem
Lech Duraj
2020-01-31
Data Structures and Algorithms · Computer Science
Linear-space LCS enumeration with quadratic-time delay for two strings
Yoshifumi Sakai
2025-05-23
Data Structures and Algorithms · Computer Science
Improved Approximation for Longest Common Subsequence over Small Alphabets
Shyan Akmal, Virginia Vassilevska Williams
2021-05-10
Data Structures and Algorithms · Computer Science
Approximating binary longest common subsequence in almost-linear time
Xiaoyu He, Ray Li
2023-02-13
Data Structures and Algorithms · Computer Science
A Linear-Time $n^{0.4}$-Approximation for Longest Common Subsequence
Karl Bringmann, Vincent Cohen-Addad, Debarati Das
2021-06-16
Data Structures and Algorithms · Computer Science
An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring inclusive constraints
Daxin Zhu, Lei Wang, Yingjie Wu, Xiaodong Wang
2015-05-26
Data Structures and Algorithms · Computer Science
Faster STR-IC-LCS computation via RLE
Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai +1
2017-03-16
Data Structures and Algorithms · Computer Science
Efficient algorithms for the longest common subsequence in $k$-length substrings
Sebastian Deorowicz, Szymon Grabowski
2013-11-20
Data Structures and Algorithms · Computer Science
Longest Common Subsequence in Sublinear Space
Masashi Kiyomi, Takashi Horiyama, Yota Otachi
2020-09-21
Data Structures and Algorithms · Computer Science
Faster Algorithms for Longest Common Substring
Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis
2025-11-18
Computational Complexity · Computer Science
Multivariate Fine-Grained Complexity of Longest Common Subsequence
Karl Bringmann, Marvin Künnemann
2018-03-05
R2 v1 2026-06-21T21:45:05.503Z