In this paper, we develop the theory for constructing linear and additive cyclic codes of odd
length over GF (4) that are suitable for DNA computing. We call this class of codes reversible …

DNA computing as a field started in 1994 when Leonard Adleman solved a hard
computational problem entirely by manipulations of DNA molecules in a test tube [1]. The …

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 …

The computation language of a DNA-based system consists of all the words (DNA strands)
that can appear in any computation step of the system. In this work we define properties of …

An essential step of any DNA computation is encoding the input data on single or double
DNA strands. Due to the biochemical properties of DNA, complementary single strands can …

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 …

Abstract (Bounded) hairpin completion and its iterated versions are operations on formal
languages which have been inspired by hairpin formation in DNA biochemistry. The paper …

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 …

In this paper we propose a new formal operation on words and languages, called
superposition. By this operation, based on a Watson–Crick-like complementarity, we can …