dna计算中的核酸序列设计及应用分析word格式论文.docx

dna计算中的核酸序列设计及应用分析word格式论文.docx

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
dna计算中的核酸序列设计及应用分析word格式论文

constructed in this thesis. A set of good DNA strings coulde be achieved using this algorithm. Furthermore, the simulation results show that the algorithm is effective in nucleic acid sequences design for DNA computing.Based on DNA hairpin structure, an operation of multiple value logic is constructed. The chemically induced DNA hairpin structure is used to construct the logic gate with multiple inputs, and the modular addition with regard to the modulus 3 is realized by the DNA hairpin structure. In DNA hairpin model for the multiple value logic operation, the logic gates can be reused after logic operation. The input signal and the output signal are in the same form represented by linear DNA strands. By this means, the signals can be transported between different logic gates. In addition, the method can be generalized to the realization of other multi-valued logic gates. The DNA model of the multi-valued logic gates has the characters of reusability and better reliability.Finally, the DNA computing is applied to solve the maximum flow problem. In order to find all augmenting paths, DNA algorithm is designed in the first stage, which can exploit the massive parallelism of DNA computing. Compared with the existing algorithms for solving augmenting path problem, the complexity of DNA algorithm for maximum flow problem is the lowest. The result indicates that combination of the DNA computing and electronic computers can obviously improve the computational efficiency in solving the maximum flow problem.Key Words: DNA encoding; Branch and cut algorithm; Filter function; Error correcting code; Multi-valued logic operation; Maximum flow problem独创性声明本人声明所呈交的学位论文是我个人在导师指导下进行的研究工作及取得 的研究成果。尽我所知,除文中已经标明引用的内容外,本论文不包含任何其他 个人或集体已经发表或撰写过的研究成果。对本文的研究做出贡献的个人和集 体,均已在文中以明确方式标明。本人完全意识到本声明的法律结果由本人承担。学位论文作者签名: 日期:年月日学位论文版权使用授权书本学位论文作者完全了解学校有关保留、使用学位论文的规定,即:学校有 权保留并向国家有关部门或机构送交论文的复印件和电子版,允许论文被查阅和 借阅。本人授权华中科技大学可以将本学位论文的全部或部分内容编入有关数据 库进行检索,可以采用影印、缩印或扫描等复制手段保存和汇编本学位论文。本论文属于保密□,在年解密后适用本授权书。不

您可能关注的文档

文档评论(0)

peili2018 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档