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]

@inproceedings{LafondZZ20,
  title = {The Tandem Duplication Distance Is NP-Hard},
  author = {Manuel Lafond and Binhai Zhu and Peng Zou},
  year = {2020},
  doi = {10.4230/LIPIcs.STACS.2020.15},
  url = {https://doi.org/10.4230/LIPIcs.STACS.2020.15},
  researchr = {https://researchr.org/publication/LafondZZ20},
  cites = {0},
  citedby = {0},
  booktitle = {37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France},
  editor = {Christophe Paul and Markus Bläser},
  volume = {154},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-140-5},
}