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.

• This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.

Creator

• Lenney, Kimberly Joy

Publisher

• Worcester Polytechnic Institute

Identifier

• 99C022M

Advisor

• Selkow, Stanley M.
• Heineman, George T.
• Sarkozy, Gabor N

Year

• 1999

Date created

• 1999-01-01

Resource type

• Major Qualifying Project

Major

• Computer Science

Rights statement

• In Copyright

Last modified

• 2021-10-11