HAIRPIN LANGUAGES-Reference-Cited by-同舟云学术

HAIRPIN LANGUAGES

Published:2001-12 Issue:06 Volume:12 Page:837-847
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

PĂUN GHEORGHE¹,ROZENBERG GRZEGORZ²³,YOKOMORI TAKASHI⁴

Affiliation:

1. Institute of Mathematics of the Romanian Academy, PO Box 1 – 764, 70700 Bucureşti, Romania

2. Leiden Institute of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333 CA Leiden, The Netherlands

3. Department of Computer Science, University of Colorado at Boulder, Boulder, CO 80309, U.S.A

4. Department of Mathematics, School of Education, Waseda University, 1-6-1 Nishi-waseda, Shinjuku-ku, Tokyo 169-8050, Japan

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.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054101000904

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hairpin completions and reductions: semilinearity properties;Natural Computing;2020-06-27

2. Further Properties of Self-assembly by Hairpin Formation;Unconventional Computation and Natural Computation;2019

3. Engineering multistate DNA molecules: a tunable thermal band‐pass filter;Micro & Nano Letters;2016-10

4. Regularity of Iterative Hairpin Completions of Crossing (2, 2)-Words;International Journal of Foundations of Computer Science;2016-02

5. Toehold DNA Languages are Regular (Extended Abstract);Algorithms and Computation;2015