Longest Common Subsequence with Gap Constraints

Duncan Adamson, Maria Kosche, Tore Koß*, Florin Manea, Stefan Siemer

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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 efficient algorithms for determining the length of the longest common constrained subsequence between two given strings.

Original languageEnglish
Title of host publicationCombinatorics on Words - 14th International Conference, WORDS 2023, Proceedings
EditorsAnna Frid, Robert Mercaş
PublisherSpringer Science and Business Media
Pages60-76
Number of pages17
ISBN (Print)9783031331794
DOIs
Publication statusPublished - 2023
Event14th International Conference on Combinatorics on Words, WORDS 2023 - Umeå, Sweden
Duration: 12 Jun 202316 Jun 2023

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13899 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Conference on Combinatorics on Words, WORDS 2023
Country/TerritorySweden
CityUmeå
Period12/06/2316/06/23

Cite this