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...
This work treats the problem of error-resilient DNA searching via oblivious evaluation of finite automata, formulated as follows: a client has a DNA sequence, and a service provid...
In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonuc...
Zuwairie Ibrahim, Yusei Tsuboi, Mohd Saufee Muhamm...
Abstract. The goal of this research is to improve the programmability of DNA-based computers. Novel clockable microreactors can be connected in various ways to solve combinatorial ...
Danny van Noort, Frank-Ulrich Gast, John S. McCask...
Self-repair is essential to all living systems, providing the ability to remain functional in spite of gradual damage. In the context of self-assembly of self-repairing synthetic b...
Urmi Majumder, Sudheer Sahu, Thomas H. LaBean, Joh...