Heineman, George T.
Sarkozy, Gabor N.
Selkow, Stanley M.
This Major Qualifying Project evaluates the feasibility of using DNA to solve NP-Complete problems. The Hamiltonian Path Problem is a known NP-Complete problem, and thus has no efficient algorithm on a traditional computer. A DNA based computer may provide a more efficient solution. Laboratory work provided the opportunity to test the validity of using DNA to solve these difficult problems. This project demonstrates that there are still many obstacles to DNA based computers.
Worcester Polytechnic Institute
Major Qualifying Project
Access to this report is limited to members of the WPI community. Please contact a project advisor or their department to request access
Restricted-WPI community only