On Solving the Multiple Variable Gapped Longest Common Subsequence Problem

arXiv:2604.18645v1 Announce Type: new Abstract: This paper addresses the Variable Gapped Longest Common Subsequence VGLCS problem, a generalization of the classical LCS problem involving flexible gap constraints between consecutive solutions' characters.