The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets.

Ferdinando Cicalese, Nicol Pilati

Browse the full IWOCA paper archive.