Font Size: a A A

Research Of DNA Computing Based On Tile Self-assembly

Posted on:2014-06-09Degree:MasterType:Thesis
Country:ChinaCandidate:G XieFull Text:PDF
GTID:2308330479479209Subject:Computer Science and Technology
Abstract/Summary:PDF Full Text Request
DNA computing is a new mode of information processing based on biochemical reactions, which is a new non-traditional computing method. DNA computing develops rapidly since 1994 and attracts widely attention of scholars all over the world. Recent years, with the development of molecular biology and nanotechnology, Self-assembly DNA computing becomes an important model of DNA computing, and has high research value. Self-assembly DNA computing becomes a potential solution for hard-compute problem for its theoretical massive storage capacity, spontaneous ordering and strong parallelism.By appropriate encoding DNA single-strand, several DNA single-strands can hybridize to DNA Tile with some cohesive ends. Tile molecule is the elementary unit of self-assembly DNA computing. Self-assembly DNA computing. Compared to other DNA computing models, self-assembly DNA computing does not require complex biochemical experiments, which increases the degree of parallelism and reduce the error of manual operation. Theoretically, it is proved that two-dimensional self-assembly DNA computing has the general computing ability and equivalent to the Turing machine. As the further developments of nanotechnology, bioinformatics and molecular biology, self-assembly DNA computing has broad application prospects, especially in optimizing calculation and cryptology.First, based on the principle of self-assembly DNA computing, this paper proposes a method of DNA encoding sequences design which can be used to design tile sequence, and also verifies the correctness effectiveness by biology experiments. Second, using abstract tile self-assembly computing model, this paper gives a method to solve Integer factorization problem, which is a hard-compute problem by designing seed module, multiplication module and copy and recognition module. This method takes full advantage of strong parallelism of self-assembly computing and can get the result in polynomial time in theory. Third, this paper has designed a program which can simulate the process of tile self-assembly and give the proper result of a given tile self-assembly model. This program can abstract DNA tile as the user’s demand and make the process visible to researchers which provides convenience for verifying the correctness and predicting the results.
Keywords/Search Tags:DNA computing, Tile self-assembly, DNA encoding sequences design, Integer factorization
PDF Full Text Request
Related items