We consider the problem of designing DNA codes, namely sets of equi-length words over
the alphabet {A, C, G, T} that satisfy certain combinatorial constraints. This problem is …

DNA computing relies on biochemical reactions of DNA molecules and may result in
incorrect or undesirable computations. Therefore, much work has focused on designing the …

Sequence design is a crucial problem in information-based biotechnology such as DNA-
based computation. We introduce a simple strategy named template method that …

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 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 design of DNA or RNA strands for DNA computations poses many new questions in
algorithms and coding theory. DNA strand design also arises in use of molecular bar codes …

Sequence-specific recognition of nucleic-acid motifs is critical to many cellular processes.
We have developed a new and general method called Neighborhood Inference (NI) that …

Molecular computing is a discipline that aims at harnessing individual molecules at
nanoscales for computational purposes. The best-studied molecules for this purpose to date …

Good design of sequences is a necessity for successful DNA computing, but how to achieve
this' goodness' is unknown. We point out the importance of adjusting the composition of …

The idea of computing with DNA was given by Tom Head in 1987, however in 1994 in a
seminal paper, the actual successful experiment for DNA computing was performed by …