Today's reconfigurable technology provides vast parallelism that may be exploited in the
design of a cellular computing machine (CCM). In this work a virtual Sblock FPGA is …

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 …

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 …

By their structure and operation, biomolecules have resolved fundamental problems as a
distributed computational system that we are just beginning to unveil. One advantageous …

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 …

Biomolecular computing (BMC) aims to capture the innumerable advantages that biological
molecules have gained in the course of millions of years for computational purposes. While …

As an emerging new research area, DNA computation, or more generally biomolecular
computation, extends into other fields such as nanotechnology and material design, and is …

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 …

The activity of mechanosensitive channels of large conductance (MscL for short) in cellular
membranes is modeled within the framework of P systems. These channels are gated by …

With This work we present algorithms to generate and test DNA code words that avoid
unwanted cross hybridizations. Methods from the theory of codes based on formal …