12. Solving a Maze Using DNA Computing

Abstract

DNA computing allows us to design linear time algorithms for problems that are intractable for conventional computing methods. The high degree of parallelism provided by DNA computing allows us to create simpler algorithms for solving computational problems. In this study, a DNA computing algorithm is proposed to solve the maze routing problem – finding the optimal path through a maze. Performing the algorithm in a biology laboratory would be impractical and would exceed the scope of this project since the experimentation itself would take days. To demonstrate the steps involved in the algorithm, a simulation was developed on a conventional computer to display the in vitro techniques that would need to be performed in order to solve a maze using DNA computing in a biology lab environment. However the simulation in silico is limited in the size of problem since the processes that would occur in parallel in vitro with DNA computing, occurs sequentially with conventional computers (in silico), causing larger problems to take exponentially longer to compute. Thus, the in silico simulation is confined to smaller, more manageable problems. This serves an example of the power of DNA computing over conventional methods. Our algorithm is the first to solve a maze routing problem using DNA computing