This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

This paper provides an overview of existing approaches to encoding information on DNA
strands for biocomputing, with a focus on the notion of Watson–Crick (WK) palindromes. We …

In this paper we study a generalization of the classical notions of bordered and unbordered
words, motivated by DNA computing. DNA strands can be viewed as finite strings over the …

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 …

The study of hairpin-free words has been initiated in the context of DNA computing. DNA
strands that, theoretically speaking, are finite strings over the alphabet {A, G, C, T} are used …

Sets of DNA strands that satisfy combinatorial and thermodynamic properties play an
important role in various approaches to biomolecular computations, nano structure design …

We study a generalization of the classical notions of bordered and unbordered words,
motivated by biomolecular computing. DNA strands can be viewed as finite strings over the …

We present general results that are useful in showing closure and decidable properties of
large classes of languages with respect to biologically-inspired operations. We use these …

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 the natural …

We consider the pseudo-inversion operation inspired by a biological event as a result of the
partial inversion. We define the pseudo-inversion of a string w= uxv to consist of all strings v …