Traveling Door to Door with a DNA Computer

Many real-world applications can be modeled with directed networks and posed as a Traveling Sales Problem (TSP). However, finding a solution to a TSP is often computationally intractable. This paper proposes a modification to a method developed by Leonard Adleman to solve the Hamiltonian Path Problem. The method uses the properties of DNA molecules to encode and manipulate data, which allows for massive parallel computations. The proposed method can find a solution to the TSP. This paper is intended for a broad audience with a basic understanding of graph theory. No prior knowledge of the biological properties of DNA is presumed.