A tandem duplication is an operation that converts a string S = AXB into a string T = AXXB. As they appear to be involved in genetic disorders, tandem duplications are widely studied in computational biology. Also, tandem duplication mechanisms have been recently studied in different contexts, from formal languages, to information theory, to error-correcting codes for DNA storage systems.

The complexity of computing the tandem duplication distance between two given strings was posed by [Leupold et al., 2004] and, very recently, it was shown to be NP-hard for the case of unbounded alphabets [Lafond et al., STACS 2020].

In this paper, we significantly improve this result and show that the tandem duplication distance problem is NP-hard already for the case of strings over an alphabet of size $\leq 5.$

We also consider the {\em existence problem}: given strings S and T over the same alphabet, decide whether there exists a sequence of duplications converting S into T. A polynomial time algorithm that solves this (existence) problem was only known for the case of the binary alphabet. We focus on a special class of strings---here referred to as purely alternating---that generalize the special structure of binary strings to larger alphabets. We show that for the case of purely alternating strings from an alphabet of size $\leq 5$, the existence problem can be solved in linear time.

https://link.springer.com/chapter/10.1007/978-3-030-79987-8_13