| DNA computing was put forward with the development of molecular biology,computer science, biotechnology and IT. Thanks to the advantages of high parallel,rapid computing, and large capacity, DNA computing has been a new computing mode,used to solve all kinds of NP complete problems. DNA computing model has beendeveloped from sticker model to finite automata, to insert-splicing system, to self-assembly system.In electronic computer, data with binary system store in semiconductor devicesand magnetic materials, but in DNA computer, all data store in DNA moleculesthrough Base Sequence. Logically, data can be divided into such basic data structuretype as stack, queue, generalized list, binary tree, graph and so on. Forestablishing document indexing in database system, Multi-way tree has uniqueadvantages, so it is used to represent and describe the data structure of documentindexing.Firstly, the thesis analysis the theory of DNA computing and DNA computingmodels, and discussion of parallel computing and structure of parallel computersmodels, and comparison with the parallel ideas in DNA molecules computing.Secondly, the thesis summarizes and analyses basic data structure in DNAcomputer suggested by some scholars, and makes some modification and optimizing,such as encoding circular queue based on sequence storage with ring DNA molecules,and marking the head of the generalized list with double DNA molecules fragment toexpress head pointer. Binary tree in sequence encoding with3D DNA molecules indetail are designed in the following.Finally, the thesis selectively analyses and designs k-arms3D DNA encoding ofB-trees and B~+-trees, and the paper gives the process of the basic operation of B-treesand B~+-trees, such as initializing, seeking, inserting, and deleting. The paper proposesa new model of DNA parallel computing, named as EPCL model, and its modifiedmodel. Parallel mechanism is added to not only the input and output of the model butalso the process of computing. |
PDF Full Text Request