Before revision:  We also consider the "existence problem" : given strings S and T over the same alphabet, decide whether there exists a sequence of duplications converting S into T.
After revision:  We also study some special classes of strings were it is possible to give linear time solutions to the existence problem : given strings S and T over the same alphabet, decide whether there exists a sequence of duplications converting S into T.