Question

Answer them please ASAP.

Why would one choose the Hamiltonian Path and Satisfiability Problems in order to demonstrate the computational power of DNA computation?

Answer 1

A Hamiltonian path is a path that visits each vertex of the graph exactly once which is also called a traceable graph.
The Boolean satisfiability problem which is abbreviated as SATISFIABILITY, is the problem of claming, that if there exists an interpretation that satisfies a given Boolean formula i.e., whether it satisfies all values or not.
DNA-based computers can be used to solve the satisfiability problem for boolean circuits and also they can solve optimization problems. DNA -based computing there have already been a number of exciting results. If in the error-free case DNA cannot do exciting things, then there is no chance in any real case. So several researchs are already in process to make DNA logorithms more noise-tolerant and more stable.
A potential DNA experiment can be described for finding a solution to another problem called Satisfiability Problem. The Satisfiability Problem consists of a Boolean expression, which decides whether it has true values or false to its variables. Hamiltonian Path Problem can be solved by an in vitro DNA-recombination assay which he performed experimentally using hybridization, agarose-gel separations, and PCR by handling DNA sequences in a test tube.