The Tandem Duplication Distance Is NP-Hard

Manuel Lafond, Binhai Zhu, Peng Zou. The Tandem Duplication Distance Is NP-Hard. In Christophe Paul, Markus Bläser, editors, 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France. Volume 154 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

Abstract

Abstract is missing.