|Math Coffee: "Solving NP-complete Problems Using Bionanotechnology" Katie Richeson ‘11
When: March 22,
Speaker: Katie Richeson ‘11Ticket Required: No
Biology has entered an era of biological mathematics, in which investigators solve mathematical problems using the self-assembling properties of DNA. My research utilizes bionanotechnology to structurally solve the mathematical complementary bounded tiling problem. The complementary bounded tiling problem belongs to the complexity class of NP-complete problems, containing difficult problems that cannot be solved efficiently. A solution to the complementary bounded tiling problem would serve as a solution to all other NP-complete mathematical problems with important practical and commercial applications, such as packing optimization, airplane schedule optimization, and finding the shortest path in a network. I have modeled and simulated in MATLAB the self-assembly of multiple tiles, and have preliminary biological evidence to suggest a successfully assembled solution to a complementary bounded tiling problem using bionanotechnology.
We will gather in Math Hall at 6:30 PM for our traditional light snacks.
Contact: Prof. Tim Chartier