Duncan Adamson

most citedLongest Common Subsequence with Gap Constraints

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

cs.DS2023★ 1 cited

Longest Common Subsequence with Gap Constraints

Duncan Adamson, Maria Kosche, Tore Koß +2

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 d…

cs.DS2023

Ranking and Unranking k-subsequence universal words

Duncan Adamson

A subsequence of a word $w$ is a word $u$ such that $u = w [i_{1}] w [i_{2}], \dots w [i_{∣ u ∣}]$ , for some set of indices $1 \leq i_{1} < i_{2} < \dots < i_{k} \leq ∣ w ∣$ . A word $w$ is $k$ -sub…