DNA Computing

DNA computing is widely accepted as a new computing framework all over the world. In this chapter, the background of DNA computing is firstly introduced by solving a Hamilton Path problem. Then three research directions are proposed according to the current development of it, including the theoretical framework, practical DNA computing models and DNA encoding. In each part of the three research directions, many recent results are involved. In the theoretical framework, DNA computing is proved to be computationally universal by four formal DNA computing models. In practical DNA computing models, DNA computing is shown to solve NP-complete problems and work well in other fields, such as medical science. In DNA encoding, some DNA codes and encoding methods are introduced to avoid the false positive phenomenon. And they have a final purpose in common: constructing a universal Biomolecular computing model, which is also called as biomolecular computer, to solve intractable problems for electrical computers. Finally, some further research directions are shown in each part for the design of biomolecular computer.