Duplication in DNA Sequences

DOI10.1007/978-3-540-85780-8_33zbMath1161.68537OpenAlexW1884273887MaRDI QIDQ3533029

Masami Ito, Shinnosuke Seki, Lila Kari, Zachary Kincaid

Publication date: 30 October 2008

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_33

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20)

Related Items (4)

On the complexity of decision problems for counter machines with applications to coding theory ⋮ Non-overlapping inversion on strings and languages ⋮ Bound-decreasing duplication system ⋮ Watson–Crick Jumping Finite Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equation \(a_ M=b^ Nc^ P\) in a free group
• Uniformly bounded duplication languages
• Closure of Language Classes Under Bounded Duplication
• Some properties of disjunctive languages on a free monoid
• Algebraic Theory of Automata and Languages
• Duplication Roots
• Aspects of Molecular Computing
• Operations and language generating devices suggested by the genome evolution

This page was built for publication: Duplication in DNA Sequences