-
[show abstract]
[hide abstract]
ABSTRACT: The solution space exponential explosion caused by the enumeration of the candidate solutions maybe is the biggest obstacle in DNA computing. In the paper, a new unenumerative DNA computing model for graph vertex coloring problem is presented based on two techniques: 1) ordering the vertex sequence for a given graph in such a way that any two consecutive labeled vertices i and i+1 should be adjacent in the graph as much as possible; 2) reducing the number of encodings representing colors according to the construture of the given graph. A graph with 12 vertices without triangles is solved and its initial solution space includes only 283 DNA strands, which is 0.0532 of 3(12) (the worst complexity).
IEEE transactions on nanobioscience 06/2011; 10(2):94-8. · 1.71 Impact Factor
-
SCIENCE CHINA Information Sciences. 01/2010; 53:1409-1416.
-
[show abstract]
[hide abstract]
ABSTRACT: The experiments have demonstrated that simple binary arithmetic and logical operations can be computed by the process of self-assembly of DNA tiles. In this paper, a subtraction in DNA computing is presented and studied with the tile assembly model. Two systems are implemented with different tiles. Both use Θ(1) input tiles (as few as 8 tiles and 16 tiles) and compute in Θ(n) steps. The theoretical analysis of systems that can assemble shapes or compute simpler functions has led to experimental manifestations of such systems using DNA tiles.
Journal of Computational and Theoretical Nanoscience 12/2009; 7(1):173-175. · 0.91 Impact Factor
