利用环状结构辅助DNA计算机体外鉴定哈密顿循环

IF 4.3 3区 材料科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC
Deepak Sharma, Manojkumar Ramteke*
{"title":"利用环状结构辅助DNA计算机体外鉴定哈密顿循环","authors":"Deepak Sharma,&nbsp;Manojkumar Ramteke*","doi":"10.1021/acscombsci.9b00150","DOIUrl":null,"url":null,"abstract":"<p >Adleman’s illustration of molecular computing using DNA paved the way toward an entirely new direction of computing (Adleman, L. M. <cite><i>Science</i></cite> <span>1994</span>, <em>266</em>, 1021). The exponential time complex combinatorial problem on a traditional computer turns out to be a separation problem involving a polynomial number of steps in DNA computing experiments. Despite being a promising concept, the implementations of existing DNA computing procedures were restricted only to the smaller size formulations. In this work, we demonstrate a structure assisted DNA computing procedure on a bigger size Hamiltonian cycle problem involving 18 vertices. The developed model involves the formation and digestion of circular structure DNA, iteratively over multiple stages to eliminate the incorrect solutions to the given combinatorial problem. A high accuracy is obtained compared to other structure assisted models, which enable one to solve the bigger size problems.</p>","PeriodicalId":3,"journal":{"name":"ACS Applied Electronic Materials","volume":null,"pages":null},"PeriodicalIF":4.3000,"publicationDate":"2020-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1021/acscombsci.9b00150","citationCount":"0","resultStr":"{\"title\":\"In Vitro Identification of the Hamiltonian Cycle Using a Circular Structure Assisted DNA Computer\",\"authors\":\"Deepak Sharma,&nbsp;Manojkumar Ramteke*\",\"doi\":\"10.1021/acscombsci.9b00150\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p >Adleman’s illustration of molecular computing using DNA paved the way toward an entirely new direction of computing (Adleman, L. M. <cite><i>Science</i></cite> <span>1994</span>, <em>266</em>, 1021). The exponential time complex combinatorial problem on a traditional computer turns out to be a separation problem involving a polynomial number of steps in DNA computing experiments. Despite being a promising concept, the implementations of existing DNA computing procedures were restricted only to the smaller size formulations. In this work, we demonstrate a structure assisted DNA computing procedure on a bigger size Hamiltonian cycle problem involving 18 vertices. The developed model involves the formation and digestion of circular structure DNA, iteratively over multiple stages to eliminate the incorrect solutions to the given combinatorial problem. A high accuracy is obtained compared to other structure assisted models, which enable one to solve the bigger size problems.</p>\",\"PeriodicalId\":3,\"journal\":{\"name\":\"ACS Applied Electronic Materials\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.3000,\"publicationDate\":\"2020-03-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1021/acscombsci.9b00150\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACS Applied Electronic Materials\",\"FirstCategoryId\":\"92\",\"ListUrlMain\":\"https://pubs.acs.org/doi/10.1021/acscombsci.9b00150\",\"RegionNum\":3,\"RegionCategory\":\"材料科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACS Applied Electronic Materials","FirstCategoryId":"92","ListUrlMain":"https://pubs.acs.org/doi/10.1021/acscombsci.9b00150","RegionNum":3,"RegionCategory":"材料科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

Adleman对利用DNA进行分子计算的阐述为计算机的全新发展方向铺平了道路(Adleman, l.m. Science 1994,266, 1021)。在DNA计算实验中,传统计算机上的指数时间复组合问题是一个涉及多项式步数的分离问题。尽管这是一个很有前途的概念,但现有DNA计算程序的实现仅限于较小尺寸的配方。在这项工作中,我们展示了一种结构辅助DNA计算程序,用于涉及18个顶点的更大尺寸哈密顿循环问题。所开发的模型涉及环状结构DNA的形成和消化,迭代多个阶段以消除给定组合问题的错误解决方案。与其他结构辅助模型相比,该模型具有较高的精度,可以解决更大的尺寸问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

In Vitro Identification of the Hamiltonian Cycle Using a Circular Structure Assisted DNA Computer

In Vitro Identification of the Hamiltonian Cycle Using a Circular Structure Assisted DNA Computer

Adleman’s illustration of molecular computing using DNA paved the way toward an entirely new direction of computing (Adleman, L. M. Science 1994, 266, 1021). The exponential time complex combinatorial problem on a traditional computer turns out to be a separation problem involving a polynomial number of steps in DNA computing experiments. Despite being a promising concept, the implementations of existing DNA computing procedures were restricted only to the smaller size formulations. In this work, we demonstrate a structure assisted DNA computing procedure on a bigger size Hamiltonian cycle problem involving 18 vertices. The developed model involves the formation and digestion of circular structure DNA, iteratively over multiple stages to eliminate the incorrect solutions to the given combinatorial problem. A high accuracy is obtained compared to other structure assisted models, which enable one to solve the bigger size problems.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
7.20
自引率
4.30%
发文量
567
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信