A formal language analysis of DNA hairpin structures

zbMATH Open1096.68084MaRDI QIDQ5482599FDOQ5482599

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

Publication date: 28 August 2006

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

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)

Cited In (18)

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