Duncan Adamson

activity

20192026

most citedLongest Common Subsequence with Gap Constraints

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

collaborators

Showing 2023Show all

3 papers · 1 filter

math.CO2023

Structural and Combinatorial Properties of 2-swap Word Permutation Graphs

Duncan Adamson, Nathan Flaherty, Igor Potapov +1

In this paper, we study the graph induced by the $2-swap$ permutation on words with a fixed Parikh vector. A $2$ -swap is defined as a pair of positions $s = (i, j)$ where…

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…