Longest Common Subsequence with Gap Constraints

Adamson, Duncan ORCID: 0000-0003-3343-2435, Kosche, Maria, Koss, Tore, Manea, Florin and Siemer, Stefan (2023) Longest Common Subsequence with Gap Constraints In: Words.

Text 2304.05270.pdf - Author Accepted Manuscript Available under License Creative Commons Attribution. Download (375kB) | Preview

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.

Item Type:	Conference Item (Unspecified)
Uncontrolled Keywords:	46 Information and Computing Sciences
Divisions:	Faculty of Science & Engineering > School of Physical Sciences
Depositing User:	Symplectic Admin
Date Deposited:	09 Jun 2023 15:51
Last Modified:	23 May 2026 07:20
DOI:	10.1007/978-3-031-33180-0_5
Related Websites:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3170913
Disclaimer:	The University of Liverpool is not responsible for content contained on other websites from links within repository metadata. Please contact us if you notice anything that appears incorrect or inappropriate.