Hairpin Structures in DNA Words

DOI10.1007/11753681_12zbMath1234.68216OpenAlexW1553144061MaRDI QIDQ3618686

Lila Kari, Petr Sosík, Gabriel Thierrin, Stavros Konstantinidis, Elena Losseva

Publication date: 2 April 2009

Published in: DNA Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11753681_12

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20)

Related Items (12)

The syntactic monoid of hairpin-free languages ⋮ Testing DNA code words properties of regular languages ⋮ On iterated hairpin completion ⋮ Hairpin structures defined by DNA trajectories ⋮ Deciding regularity of hairpin completions of regular languages in polynomial time ⋮ k-involution codes and related sets ⋮ Watson-Crick palindromes in DNA computing ⋮ Watson-Crick Conjugate and Commutative Words ⋮ On conflict free DNA codes ⋮ On pseudoknot-bordered words and their properties ⋮ Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract) ⋮ INNER PALINDROMIC CLOSURE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of non-crosshybridizing DNA oligonucleotides manufactured in vitro
• Intersection and union of regular languages and state complexity
• Theoretical and experimental DNA computation.
• Sticky-free and overhang-free DNA languages
• Developments in Language Theory
• DNA Computing
• DNA Computing
• DNA Computing
• DNA Computing

This page was built for publication: Hairpin Structures in DNA Words