On Solving the Multiple Variable Gapped Longest Common Subsequence Problem

This paper tackles the Variable Gapped Longest Common Subsequence (VGLCS) problem, a generalization of LCS with flexible gap constraints, relevant to molecular sequence comparison and time-series analysis. It proposes a root-based state graph search framework combined with an iterative beam search strategy to manage combinatorial explosion and find high-quality solutions.