Faculty Advisor

Heineman, George T.

Faculty Advisor

Sarkozy, Gabor N.

Faculty Advisor

Selkow, Stanley M.

Abstract

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.

Publisher

Worcester Polytechnic Institute

Date Accepted

January 1999

Major

Computer Science

Project Type

Major Qualifying Project

Accessibility

Restricted-WPI community only

Advisor Department

Computer Science

Advisor Program

Computer Science

Share

COinS