This document summarizes a research article about using DNA computing to solve complex problems. It discusses:

1) How DNA computing works by using DNA strands instead of silicon chips for data storage and processing. DNA strands can solve problems in parallel much faster than traditional computers. 

2) An example of using DNA computing to solve the traveling salesman problem presented by Adelman in 1994. The document explains Adelman's algorithm and how it was implemented in a lab using DNA strands to find the shortest path between cities.

3) Some flaws in Adelman's original method, such as other non-solution DNA strands being produced. The document describes how these flaws were addressed in the lab by using PCR to

Review of DNA Computing and Its Application in Complex Problems Solvation, Adelman Problem Solution in Using of DNA Via Experimental Methods PDF

The list of books you might like