Quadratic-time Algorithm for the String Constrained LCS Problem

TL;DR

This paper introduces a quadratic-time algorithm for the string constrained longest common subsequence problem, significantly improving the efficiency over previous cubic-time algorithms.

Contribution

The paper presents the first quadratic-time algorithm for the STR-IC-LCS problem, advancing the computational efficiency for this constrained sequence matching task.

Findings

Quadratic-time algorithm outperforms cubic-time algorithms

Significant reduction in computational complexity

Potential for faster sequence analysis applications

Abstract

The problem of finding a longest common subsequence of two main sequences with some constraint that must be a substring of the result (STR-IC-LCS) was formulated recently. It is a variant of the constrained longest common subsequence problem. As the known algorithms for the STR-IC-LCS problem are cubic-time, the presented quadratic-time algorithm is significantly faster.