Results

**1 - 2**of**2**### ERROR-TOLERANT MINIMUM FINDING WITH DNA COMPUTING

, 2008

"... Abstract. In the past decade, DNA computing has become one of the powerful approaches to solve a class of intractable computational problems such as Hamiltonian path problem and SAT problem. The power of DNA computing comes from the fact that it has great potential of massive data storage and proces ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract. In the past decade, DNA computing has become one of the powerful approaches to solve a class of intractable computational problems such as Hamiltonian path problem and SAT problem. The power of DNA computing comes from the fact that it has great potential of massive data storage and processing computation over data in parallel. In this paper, an algorithm for solving the minimum finding problem is proposed in theory with a randomized scheme – the broadcasting scheme on the broadcast communication model. Our method is a novel strategy for optimization in DNA computing, since it can tolerate some chemistry reaction and experiment errors. The less errors are, the less the number of required iterations is. A series of computer simulations are also performed and analyzed to demonstrate the feasibility of the algorithm and the designed experiment.

### Department of Medical Imaging and Radiological Sciences,

"... Nearly in the past decade, DNA computing has become one of the powerful approaches to solve a class of intractable computational problems such as Hamiltonian path problem and SAT problem. The power of DNA computing comes from the fact that it has great potential of massive data storage and processin ..."

Abstract
- Add to MetaCart

(Show Context)
Nearly in the past decade, DNA computing has become one of the powerful approaches to solve a class of intractable computational problems such as Hamiltonian path problem and SAT problem. The power of DNA computing comes from the fact that it has great potential of massive data storage and processing computation over data in parallel. In this work, an algorithm for solving the minimum finding problem is proposed in theory with a randomized scheme-- the broadcasting scheme on the broadcast communication model. In our algorithm, chemistry experiment errors have been taken into consideration. Thus, our algorithm can tolerate some chemistry reaction and experiment errors. To demonstrate the feasibility of the algorithm and the designed experiment, several tasks of simulation were also performed and analyzed. Key words: molecular computing, DNA computing, minimum finding, chemistry experiment error 1.