Hairpin languages

Gheorghe Pǎun; Grzegorz Rozenberg; Takashi Yokomori

doi:10.1142/S0129054101000904

Hairpin languages

Gheorghe Pǎun, Grzegorz Rozenberg, Takashi Yokomori

School of Education

Research output: Contribution to journal › Article › peer-review

26 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	837-847
Number of pages	11
Journal	International Journal of Foundations of Computer Science
Volume	12
Issue number	6
DOIs	https://doi.org/10.1142/S0129054101000904
Publication status	Published - 2001 Jan 1

ASJC Scopus subject areas

Computer Science (miscellaneous)

Access to Document

10.1142/S0129054101000904

Cite this

@article{16e712005880453a80af9ff922f3a946,

title = "Hairpin languages",

abstract = "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.",

author = "Gheorghe Pǎun and Grzegorz Rozenberg and Takashi Yokomori",

year = "2001",

month = jan,

day = "1",

doi = "10.1142/S0129054101000904",

language = "English",

volume = "12",

pages = "837--847",

journal = "International Journal of Foundations of Computer Science",

issn = "0129-0541",

publisher = "World Scientific Publishing Co. Pte Ltd",

number = "6",

}

TY - JOUR

T1 - Hairpin languages

AU - Pǎun, Gheorghe

AU - Rozenberg, Grzegorz

AU - Yokomori, Takashi

PY - 2001/1/1

Y1 - 2001/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33745049253&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745049253&partnerID=8YFLogxK

U2 - 10.1142/S0129054101000904

DO - 10.1142/S0129054101000904

M3 - Article

AN - SCOPUS:33745049253

SN - 0129-0541

VL - 12

SP - 837

EP - 847

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

IS - 6

ER -

Hairpin languages

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this