An Algorithm for the Constrained Longest Common Subsequence and Substring Problem
Journal: Journal of Mathematics and Informatics, Vol. 26, 2024
Authors: Rao Li, Jyotishmoy Deka, Kaushik Deka, and Dorothy Li
Abstract
The Longest Common Subsequence (LCS) and Longest Common Substring (LCStr) problems are classical problems in computer science with wide-ranging applications in biology, data compression, and text editing. This paper introduces an efficient algorithm to solve these problems under specific constraints, improving upon existing methods for certain classes of sequences.