Uniformly bounded duplication languages

DOI10.1016/j.dam.2004.10.003zbMath1077.68047OpenAlexW1986404017MaRDI QIDQ1763482

Carlos Martín-Vide, Peter Leupold, Victor Mitrana

Publication date: 22 February 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.10.003

zbMATH Keywords

Finite automatonBounded duplication distanceBounded duplication languageBounded duplication root

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (13)

Tandem Duplications, Segmental Duplications and Deletions, and Their Applications ⋮ Languages generated by iterated idempotency ⋮ On the maximum number of non-confusable strings evolving under short tandem duplications ⋮ Uniformly bounded duplication codes ⋮ Duplication in DNA Sequences ⋮ General Idempotency Languages Over Small Alphabets ⋮ On the Prefix–Suffix Duplication Reduction ⋮ On Compensation Loops in Genomic Duplications ⋮ Deciding the Confusability of Words under Tandem Repeats in Linear Time ⋮ Bound-decreasing duplication system ⋮ Watson–Crick Jumping Finite Automata ⋮ Computing the Tandem Duplication Distance is NP-Hard ⋮ The tandem duplication distance problem is hard over bounded alphabets

Cites Work

• Aspects of Molecular Computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Uniformly bounded duplication languages