Sticker DNA computer model ——PartⅡ: Application

Sticker model is one of the basic models in the DNA computer models. This model is coded with sin-gle-double stranded DNA molecules. It has the following advantages that the operations require no strands extension and use no enzymes; What抯 more, the materials are reusable. Therefore, it arouses attention and interest of scientists in many fields. In this paper, we extend and improve the sticker model, which will be definitely beneficial to the construction of DNA computer. This paper is the second part of our series paper, which mainly focuses on the application of sticker model. It mainly consists of the following three sections: the matrix representation of sticker model is first presented; then a brief review of the past research on graph and com-binatorial optimization, such as the minimal set covering problem, the vertex covering problem, Hamiltonian path or cycle problem, the maximal clique problem, the maximal independent problem and the Steiner spanning tree problem, is described; Finally a DNA algorithm for the graph iso-morphic problem based on the sticker model is given.     

Sticker DNA computer model ——Part Ⅰ: Theory

DNAcomputationisanewcomputationalpatternusingDNAmoleculesandsomeenzymesforessentialmaterials,whichisbasedonsomebiochemicalreactions.ThiscomputationalmethodwasfirstlyproposedbyDr.Adlemanin1994[1].ItsprominentadvantageismakingthebestofDNAmoleculeswithenormousmemorygeneticcodes,andimmenseparallelismofbiochemicalreactions.Asaresult,DNAcomputersbasedontheDNAcomputa-tionmodelwillhaveenormousmemorycapacityandegregiousoperationspeed.DNAcomputercanrunwithhighspeed,enormousinformationmemorycapab…     

A DNA computer model for solving vertex coloring problem

Since Adleman[1] demonstrated the way to apply standard methods of molecular biology to solving a hard computational problem, the research of DNA computation and DNA computer have made much headway. So far, many DNA computing models have been brought forw…