Implementing Data Structure Using DNA: An Alternative in Post CMOS Computing

DNA computing has attracted the eyes of many researchers in recent years to solve NP-complete problems. It over-performs conventional computers due to its inherent massively parallelism nature. But to make it generally applicable, problems those are very much implement able on conventional computers, should also be implement able on a DNA computer. To implement those problems, data structures are unavoidable. In this work, possible implementations of several data structures viz stack, queue, list with insertions and deletions at random indexes have been presented. Additionally, maps and possible operations on them have been proposed. Proposed implementations are kept extremely simple, and can be practically implemented quite easily. This work is expected to serve as an important step towards the applicability of a DNA computer and to prove its efficacy as a promising alternative in tomorrows post CMOS computing paradigm.