Before revision:  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.
After revision:  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.