Take Advantage of the Computing Power of DNA Computers

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.

• Type: Conference
• Year: 2000
• Where: IPPS
• Authors: Zhiquan Frank Qiu, Mi Lu
• Keywords: Combinatorial Molecular Method, Distributed And Parallel Computing, Hamilton Path Problem, Initial Condition, IPPS 2000