Hairpin Structures in DNA Words

DOI10.1007/11753681_12MaRDI QIDQ3618686zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• A formal language analysis of DNA hairpin structures
• Developments in Language Theory
• Hairpin structures defined by DNA trajectories
• Hairpin Structures Defined by DNA Trajectories
• Hairpin languages

Cites work

• Characterization of non-crosshybridizing DNA oligonucleotides manufactured in vitro
• Developments in Language Theory
• DNA Computing
• DNA Computing
• DNA Computing
• DNA Computing
• scientific article; zbMATH DE number 53946 (Why is no real title available?)
• scientific article; zbMATH DE number 1236223 (Why is no real title available?)
• scientific article; zbMATH DE number 1933226 (Why is no real title available?)
• scientific article; zbMATH DE number 1953217 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 2087011 (Why is no real title available?)
• scientific article; zbMATH DE number 1568800 (Why is no real title available?)
• Intersection and union of regular languages and state complexity
• Sticky-free and overhang-free DNA languages
• Theoretical and experimental DNA computation.

Cited in

(24)

• On pseudoknot-bordered words and their properties
• On conflict free DNA codes
• Hairpin structures defined by DNA trajectories
• The syntactic monoid of hairpin-free languages
• Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)
• scientific article; zbMATH DE number 5722790 (Why is no real title available?)
• scientific article; zbMATH DE number 1953217 (Why is no real title available?)
• Inner palindromic closure
• Hairpin languages
• k-involution codes and related sets
• Hairpin Structures Defined by DNA Trajectories
• Unravel Four Hairpins!
• Watson-Crick Conjugate and Commutative Words
• Developments in Language Theory
• A formal language analysis of DNA hairpin structures
• On iterated hairpin completion
• Aspects of Molecular Computing
• Watson-Crick palindromes in DNA computing
• DNA codes from skew dihedral group ring
• New constructions of reversible DNA codes
• Hairpin completion distance lower bound
• Constructing k-ary orientable sequences with asymptotically optimal length
• Deciding regularity of hairpin completions of regular languages in polynomial time
• Testing DNA code words properties of regular languages

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

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