@inproceedings{42323badc5004f84a2de5cef616fb760,
title = "Longest Common Subsequence with Gap Constraints",
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.",
author = "Duncan Adamson and Maria Kosche and Tore Ko{\ss} and Florin Manea and Stefan Siemer",
note = "Publisher Copyright: {\textcopyright} 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.; 14th International Conference on Combinatorics on Words, WORDS 2023 ; Conference date: 12-06-2023 Through 16-06-2023",
year = "2023",
doi = "10.1007/978-3-031-33180-0_5",
language = "English",
isbn = "9783031331794",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media",
pages = "60--76",
editor = "Anna Frid and Robert Merca{\c s}",
booktitle = "Combinatorics on Words - 14th International Conference, WORDS 2023, Proceedings",
address = "United States",
}