| Popis: |
Over the past few years, a handful of insightful researchers have get a new method of computing-DNA computing. DNA computing is a novel method based on bio-chemistry. Since Adelman solved Directed Hamilton Path by encoding and molecular-biological manipulations in 1994, DNA computing have become an attractive field. In the paper, we solve a famous problem (working operation problem) of operation research based on Adelman'S approach. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems. |
