Font Size: a A A

The Application Of Molecular Beacon Detection Model In Several Graph Theory Problems

Posted on:2017-04-02Degree:MasterType:Thesis
Country:ChinaCandidate:S ShaFull Text:PDF
GTID:2180330485491285Subject:Applied Mathematics
Abstract/Summary:PDF Full Text Request
In the mid 90’s of last century, Adleman proposed a new method of calculation and used it to solve the famous mathematical problem ’Hamilton problem with seven nodes’, let the DNA computing begin. DNA computing is the qualification of should be the result of the operation to delete selected a controlled biochemical reactions. Compared with the traditional electronic computer, DNA computing has vast amounts of data resources, storage space and can be highly parallel computing power, made up for the inadequacy of its storage and computing speed. Molecular beacon is targeting a specific detection of DNA and RNA sequences hairpin-shaped nucleic acid probe, which was first built by Tyagi and Krammer in 1996, for the purpose of quantitatiing determination of the amount of target in the liquid phase. The molecular beacon has simple operation, high sensitivity, strong specificity, and can set the nucleic acids in real time measurement, and even can be used in the analysis of living body etc, in the past decade, it has wild use in the chemical, biological and medical and other fields.Graph theory provides a mathematical model for a system that contains binary relation, and can describe many problems in real life with mathematics abstract form. With the development of mathematics, computer science and biological sciences, graph theory has been applied to various fields as a classic subject, such as physics, computer technology, communication science, architecture, economics and psychology, etc.Based on DNA computing,this paper introduces the design, working principle and application of molecular beacon firstly. Secondly, this article is based on the principle that different molecular beacon is constituted by different fluorescent molecular-quenching molecular and given a testing model to Hamilton circle problem.Thirdly, it introduces the maximum matching problem, based on the technology of molecular beacon detection by encoding molecular beacon ring can detect specific figure specific edge, and no longer detected by fluorescence strengthening to determine the reaction completely.Finally, we solve travelling salesman problem by a model named probe machine.
Keywords/Search Tags:DNA computing, molecular beacon, Hamilton circle, probe model, traveling salesman problem
PDF Full Text Request
Related items