Molecules with hairpin structure(s) form a natural extension of linear non-branched molecules, and they have been already used in experimental work in DNA computing. In this paper we introduce and investigate classes of string languages (hence languages modeling the sets of linear DNA molecules), consisting of strings which can (fold on itself and) form hairpins. We classify the complexity of these classes using language-theoretic techniques. We also discuss a further use of hairpin molecules in DNA computing.
|ジャーナル||International Journal of Foundations of Computer Science|
|出版ステータス||Published - 2001 1 1|
ASJC Scopus subject areas
- コンピュータ サイエンス（その他）