Subsequence Matching and LCS with Segment Number Constraints.
The 14th International Conference on Algorithms and Complexity (CIAC 2025),
Lecture Notes in Computer Science Vol.15680, pp.136-150
(2025), [peer-reviewed]
Event Date:
June 10-12, 2025
@ Rome, Italy
- Rome, Italy
Abstract / 概要
The longest common subsequence (LCS) is a fundamental problem in string processing which has numerous algorithmic studies, extensions, and applications. A sequence $$u_1, \ldots , u_f$$…