"The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets."

Ferdinando Cicalese, Nicolò Pilati (2021)

Details and statistics

DOI: 10.1007/978-3-030-79987-8_13

access: closed

type: Conference or Workshop Paper

metadata version: 2021-07-29

a service of  Schloss Dagstuhl - Leibniz Center for Informatics