A formal language analysis of DNA hairpin structures

MaRDI QIDQ5482599zbMATH OpenFDO

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

Publication date 28 August 2006

zbMATH Keywords

DNA computingDNA hairpinformal languageinvolution

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20)

Recommendations

• Developments in Language Theory
• Hairpin Structures in DNA Words
• Hairpin languages
• Language theoretical properties of hairpin formations
• The syntactic monoid of hairpin-free languages

Cited in

(19)

• Formal language representation and modelling structures underlying RNA folding process
• Sticky-free and overhang-free DNA languages
• Pseudo-inversion: closure properties and decidability
• Hairpin structures defined by DNA trajectories
• On decidability and closure properties of language classes with respect to bio-operations
• The syntactic monoid of hairpin-free languages
• A formal language model of DNA polymerase enzymatic activity
• Iterated hairpin completions of non-crossing words
• Hairpin Lengthening and Shortening of Regular Languages
• scientific article; zbMATH DE number 5722790 (Why is no real title available?)
• Hairpin Structures in DNA Words
• Decidability of involution hypercodes
• Hairpin languages
• A minimal normal form for DNA expressions
• Hairpin Structures Defined by DNA Trajectories
• Developments in Language Theory
• Hairpin completion distance lower bound
• An extension of the Lyndon-Schützenberger result to pseudoperiodic words
• Testing DNA code words properties of regular languages

This page was built for publication: A formal language analysis of DNA hairpin structures

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