科研之友
微信
新浪微博
Facebook
分享链接
摘要
In DNA computer research, the quality of a model that is set up in DNA computing has a direct effect on all its aspects, such as the difficulty of encoding, all designs of bio-operation and biochemistry reactions, the size of solution space and the problems of computing time. Moreover, such models have an influence on the application and the extent of computer universality. Therefore, for a 10-years-old "DNA computer," research on its model is obviously very important for this problem. How to establish a high-speed and powerful DNA computing model with a certain universality and with DNA molecular characteristics (by using the existing IT technology and electronic computer tools that are based upon bio-operations and biochemistry action tests) is a difficult problem that computer researchers have been interested in. This paper will discuss DNA computing models. We will look at some of the models that have been developed in the last 10 years, in particular three types of models. One type is several main models built by using DNA molecular structures and characteristics, such as the sticker DNA computing model, DNA computing model based on splicing operation, hairpin DNA computing model, plasmid DNA computing model, and k-arm-based molecular computing model, insertion-detection systems model. A second type is making use of the bio-operation method to build three kinds of models: tube type, surface type and chip type. A third type is the so-called DNA computing model, such as Turing machine DNA computing models that simulate Boolean circuits on a DNA computer, and self-assembled models and DNA computing models used in analysis of the gene expression. This paper discusses the basic principles, functions, merits and demerits of these models and research progress, etc. In the end, we analyze the difficulties of the DNA computing model and provide ways of solving the problem correspondingly.
- 出版日期2007-12
- 单位北京大学
