Since it is NP-complete, the massive parallel computing power of a solution of DNA could be desirable to find a solution for problems with many vertices.  
In 1994, Leonard Adleman used a variety of molecular biological and genetic techniques to have DNA find a solution to this problem.  Since it is NP-complete, the massive parallel computing power of a solution of DNA could be desirable to find a solution for problems with many vertices.  To find a solution for a given directed graph, one must begin at the designated starting point, finish at the designated end point, and pass through each vertex exactly once.  FTP, identify this problem of which the traveling salesman problem is a simplifie version and which is named for a 19th-century Irish mathematician.
In 1994, Leonard Adleman used a variety of molecular biological and genetic techniques to have DNA find a solution to this problem.  
Hamiltonian Path Problem