Coding and information theory
Intersection and union of regular languages and state complexity
Information Processing Letters
Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 1
Handbook of formal languages, vol. 1
On the combinatorics of finite words
Theoretical Computer Science
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Algorithms for Testing That Sets of DNA Words Concatenate without Secondary Structure
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Computation in Living Cells: Gene Assembly in Ciliates (Natural Computing Series)
Computation in Living Cells: Gene Assembly in Ciliates (Natural Computing Series)
Theoretical and Experimental DNA Computation (Natural Computing Series)
Theoretical and Experimental DNA Computation (Natural Computing Series)
Some properties of ciliate bio-operations
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Efficient algorithm for testing structure freeness of finite set of biomolecular sequences
DNA'05 Proceedings of the 11th international conference on DNA Computing
Bond-free languages: formalizations, maximality and construction methods
DNA'04 Proceedings of the 10th international conference on DNA computing
Testing structure freeness of regular sets of biomolecular sequences
DNA'04 Proceedings of the 10th international conference on DNA computing
Aqueous computing with DNA hairpin-based RAM
DNA'04 Proceedings of the 10th international conference on DNA computing
Semiring structures of some classes of hypercodes
Journal of Automata, Languages and Combinatorics
An extension of the Lyndon--Schützenberger result to pseudoperiodic words
Information and Computation
Iterated hairpin completions of non-crossing words
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Hi-index | 0.01 |
The concept of hairpin structures in formal languages is motivated from the biocomputing and bioinformatics fields. Hairpin (-free) DNA structures have numerous applications to DNA computing and molecular genetics in general. A word is called hairpin-free if it cannot be written in the form xuyθ(u)z, with certain additional conditions, for an involution θ (a function θ with the property that θ$^2$ equals the identity function). A particular involution, the so-called Watson-Crick involution, can characterize binding of two DNA strands. We study algebraic and decision properties, finiteness and descriptional complexity of hairpin (-free) languages. We show an existence of polynomial-time algorithms deciding hairpin-freeness of regular and context-free sets. Two related DNA secondary structures are considered, taking into the account imperfect bonds (bulges, mismatches) and multiple hairpins. Finally, effective methods for design of long hairpin-free DNA words are given.