PubMed · 10636039
Three dimensional DNA structures in computing.
Abstract
We show that 3-dimensional graph structures can be used for solving computational problems with DNA molecules. Vertex building blocks consisting of k-armed (k = 3 or 4) branched junction molecules are used to form graphs. We present procedures for the 3-SAT and 3-vertex-colorability problems. Construction of one graph structure (in many copies) is sufficient to determine the solution to the problem. In our proposed procedure for 3-SAT, the number of steps required is equal to the number of variables in the formula. For the 3-vertex-colorability problem, the procedure requires a constant number of steps regardless of the size of the graph.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
N Jonoska, S A Karl, M Saito. 1999. Three dimensional DNA structures in computing.. https://doi.org/10.1016/s0303-2647(99)00041-6. https://pubmed.health/record/pubmed%3A10636039/three-dimensional-dna-structures-in-computing
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite PubMed Health by Indiciae: BibTeX · RIS.