DNA computing is an area of natural computing based on the idea that molecular biology
processes can be used to perform arithmetic and logic operations on information encoded …

The set of all sequences that are generated by a biomolecular protocol forms a language
over the four letter alphabet Δ={A, G, C, T}. This alphabet is associated with a natural …

We formalize the notion of a DNA hairpin secondary structure, examining its mathematical
properties. Two related secondary structures are also investigated, taking into the account …

The paper examines the concept of hairpin-free words motivated from the biocomputing and
bioinformatics fields. Hairpin (-free) DNA structures have numerous applications to DNA …

For an involution θ: Σ*→ Σ* over a finite alphabet Σ we consider involution codes: θ-infix, θ-
comma-free, θ-k-codes and θ-subword-k-codes. These codes arise from questions on DNA …

The input data for DNA computing must be encoded into the form of single or double DNA
strands. As complementary parts of single strands can bind together forming a double …

The concept of hairpin structures in formal languages is motivated from the biocomputing
and bioinformatics fields. Hairpin (-free) DNA structures have numerous applications to DNA …

One of the main research topics in DNA computing is associated with the design of
information encoding single or double stranded DNA strands that are “suitable” for …

We have developed a method for designing rapidly-hybridizing orthonormal DNA
sequences. Two conditions were used in the prediction method. One condition concerned …

The input data for DNA computing must be encoded into the form of single or double DNA
strands. As complementary parts of single strands can bind together forming a double …