Twenty years of DNA computing: From complex combinatorial problems to the Boolean circuits

Kuntala Boruah, J. C. Dutta
{"title":"Twenty years of DNA computing: From complex combinatorial problems to the Boolean circuits","authors":"Kuntala Boruah, J. C. Dutta","doi":"10.1109/EDCAV.2015.7060538","DOIUrl":null,"url":null,"abstract":"This paper describes the development of molecular computing in an historical setting. Based on the idea that basic biochemical property of deoxyribonucleic acid (DNA) molecule can be employed to solve Nondeterministic Polynomial Time (NP) problem, several remarkable models and algorithms are proposed for solving complex combinatorial problems. The development is not limited to that; it extends up to the implementation of molecular Boolean Circuits for realization of biological computer. It is concluded that in the past 20 years the DNA research and development made progress on regular base, but the practical line is still lacking behind. The research work in this field is expected to be good in next few decades.","PeriodicalId":277103,"journal":{"name":"2015 International Conference on Electronic Design, Computer Networks & Automated Verification (EDCAV)","volume":"392 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Electronic Design, Computer Networks & Automated Verification (EDCAV)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EDCAV.2015.7060538","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

This paper describes the development of molecular computing in an historical setting. Based on the idea that basic biochemical property of deoxyribonucleic acid (DNA) molecule can be employed to solve Nondeterministic Polynomial Time (NP) problem, several remarkable models and algorithms are proposed for solving complex combinatorial problems. The development is not limited to that; it extends up to the implementation of molecular Boolean Circuits for realization of biological computer. It is concluded that in the past 20 years the DNA research and development made progress on regular base, but the practical line is still lacking behind. The research work in this field is expected to be good in next few decades.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
二十年的DNA计算:从复杂的组合问题到布尔电路
本文描述了分子计算在历史背景下的发展。基于脱氧核糖核酸(DNA)分子的基本生化性质可用于求解非确定性多项式时间(NP)问题的思想,提出了几种求解复杂组合问题的杰出模型和算法。发展并不局限于此;它扩展到实现分子布尔电路来实现生物计算机。结果表明,近20年来,DNA的研究与开发在常规基础上取得了进展,但在实际应用方面仍有欠缺。在未来的几十年里,这一领域的研究工作有望得到很好的发展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Numerical modelling for a basic switching unit based on nonlinear plasmonic two mode waveguide Color image noise removal by modified adaptive threshold median filter for RVIN A review on accelerating scientific computations using the Conjugate Gradient method A novel approach for constrained via minimization problem in VLSI channel routing A method for determination of depletion width of single and double gate junction less transistor
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1