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 computinginvolutionformal languageDNA hairpin

Mathematics Subject Classification ID

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

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

(18)

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