MOLECULAR COMPUTATION: A DNA‐BASED MODEL FOR SOLVING MATHEMATICAL PROBLEMS

DNA computing is a rapidly growing field that utilizes DNA’s natural potential to spontaneously assemble and store information. DNA is also easy to manipulate which makes it adaptable to a wide range of applications. DNA computing uses this potential to solve computationally difficult mathematical problems. Creating a functional library of combinatorial strands of the required length is a prerequisite for a DNA computing model. This task is accomplished by using a computer algorithm that produces DNA sequences that will bind only to their complements. Validation of this algorithm was performed on test strand using SYBR Green I dye and a Real‐time PCR machine to measure florescence. After validation was completed construction of the library was able to begin. We used a DNA polymerase‐based method to combine ten unique, 16 base pair, single‐stranded oligonucleotides, to from a library of 32 double‐stranded molecules of length 80 base pairs.