In this paper we propose a new formal operation on words and languages suggested by
DNA manipulation, called hairpin completion. By this operation, based on a Watson-Crick …

We consider a few algorithmic problems regarding the hairpin completion. The first problem
we consider is the membership problem of the hairpin and iterated hairpin completion of a …

We consider two complementary operations: Hairpin completion introduced in [D. Cheptea,
C. Martin-Vide, V. Mitrana, A new operation on words suggested by DNA biochemistry …

Self-assembly is the process in which simple objects autonomously aggregate into large
structures and it has become one of the major tools for nano-scale engineering. We propose …

We define the hairpin reduction as the inverse operation of a formal operation on words and
languages suggested by DNA biochemistry, namely the hairpin completion, introduced in …

The problem of data and information encoding on DNA bears an increasing interest for both
biological and nonbiological applications of biomolecular computing. Recent experimental …

This paper investigates properties of the binary string and language operation overlap
assembly which was defined by Csuhaj-Varjú, Petre and Vaszil as a formal model of the …

Hairpin completion is a formal operation inspired from biochemistry. Here we consider a
restricted variant of hairpin completion called bounded hairpin completion. Applied to a word …

The hairpin completion is a natural operation of formal languages which has been inspired
by molecular phenomena in biology and by DNA-computing. We consider here a new …

We propose and investigate a formal language operation inspired by the naturally occurring
phenomenon of DNA primer extension by a DNA-template-directed DNA Polymerase …