Solving Hamiltonian path problem using DNA computing

Hamiltonian path problem is a combinatorial problem. This problem requires an exponential time to compute using traditional computing methods and algorithms. There is a way of reducing the computational time from exponential to polynomial time by connecting the ending vertex with the starting vertex creating a Hamiltonian Cycle. But we wanted to solve the Hamiltonian path problem. The Hamiltonian path for a small graph is easy to find. But, for a graph with numerous vertices, it is hard to find. Traditional computers take a long time to solve this problem. So, we need parallel computing to solve such a problem. One substance in nature has the ability to compute parallelly. DNA molecules are capable to compute parallelly. We have done some work on this to find the solution to this problem. We have conducted the test and successfully can generate a Hamiltonian path from any kind of graph. For small problems, this approach is not efficient, but for large problems, DNA molecules work way better.