The tandem duplication distance problem is hard over bounded alphabets

DOI10.1007/978-3-030-79987-8_13MaRDI QIDQ2115851zbMATH OpenOpenAlexFDO

Authors Ferdinando Cicalese, Nicolò Pilati

Publication date 22 March 2022

Full work available at URL https://arxiv.org/abs/2004.02338

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites work

• 2726. A problem on strings of beads
• Aspects of Molecular Computing
• Capacity and Expressiveness of Genomic Tandem Duplication
• Closure of Language Classes Under Bounded Duplication
• Deciding the confusability of words under tandem repeats in linear time
• Duplication Distance to the Root for Binary Sequences
• Duplication Roots
• Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms
• Languages generated by iterated idempotency
• On regularity of languages generated by copying systems
• On the regularity of languages on a binary alphabet generated by copying systems
• The Capacity of String-Duplication Systems
• Uniformly bounded duplication languages

Cited in

(3)

• The longest letter-duplicated subsequence and related problems
• The Tandem Duplication Distance Is NP-Hard
• The longest subsequence-repeated subsequence problem

This page was built for publication: The tandem duplication distance problem is hard over bounded alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115851)