Longest Common Subsequence with Gap Constraints

2023/04/11 by Duncan Adamson, Maria Kosche, Adamson, Duncan +7
Biochemistry, Genetics and Molecular Biology · Computer Science · #Algorithms and Data Compression #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Genome Rearrangement Algorithms #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.2304.05270

openalex publication_date 2023/04/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We consider the longest common subsequence problem in the context of subsequences with gap constraints. In particular, following Day et al. 2022, we consider the setting when the distance (i. e., the gap) between two consecutive symbols of the subsequence has to be between a lower and an upper bound (which may depend on the position of those symbols in the subsequence or on the symbols bordering the gap) as well as the case where the entire subsequence is found in a bounded range (defined by a single upper bound), considered by Kosche et al. 2022. In all these cases, we present effcient algorithms for determining the length of the longest common constrained subsequence between two given strings.

Related

• An Algorithm for the Constrained Longest Common Subsequence and Substring Problem
• Subsequences With Gap Constraints: Complexity Bounds for Matching and Analysis Problems
• An Algorithm for the Longest Common Subsequence and Substring Problem
• Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings
• Longest common subsequences and the Bernoulli matching model: numerical work and analyses of the r-reach simplification