Talk page

Title:
The Tandem Duplication Distance Problem is hard over bounded alphabets

Speaker:
Ferdinando Cicalese*

Link:
https://video-archive.fields.utoronto.ca/view/14102

Workshop:
Fields- IWOCA 2021 - 32nd International Workshop on Combinatorial Algorithms