Take Advantage of the Computing Power of DNA Computers

Authors:
Z. Frank Qiu;Mi Lu
Affiliations:
-;-
Venue:
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Year:
2000

Citing 3
Cited 1

Molecular computation of solutions to combinatorial problems

Science
Introduction to Algorithms: A Creative Approach

Introduction to Algorithms: A Creative Approach
Algorithmic self-assembly of dna

Algorithmic self-assembly of dna

Interdisciplinary issues for the management of next generation autonomic wireless systems: nature-inspired techniques and organic computing

International Journal of Mobile Network Design and Innovation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ever since Adleman [1] solved the Hamilton Path problem using a combinatorial molecular method, many other hard computational problems have been investigated with the proposed DNA computer [3] [25] [9] [12] [19] [22] [24] [27] [29] [30]. However, these computation methods all work toward one destination through a couple of steps based on the initial conditions. If there is a single change on these given conditions, all the procedures need to be gone through no matter how complicate these procedures are and how simple the change is. The new method we are proposing here in the paper will take care of this problem. Only a few extra steps are necessary to take when the initial condition has been changed. This will provide a lot of savings in terms of time and cost.