Andrea Sackmann, K. Brown, P. Formanowicz, Kevin Morgan, N. Kalsheker, Jon M. Garibaldi, Jacek Błażewicz
{"title":"A DNA Algorithm for Calculating the Maximum Flow of a Network","authors":"Andrea Sackmann, K. Brown, P. Formanowicz, Kevin Morgan, N. Kalsheker, Jon M. Garibaldi, Jacek Błażewicz","doi":"10.2478/fcds-2023-0021","DOIUrl":null,"url":null,"abstract":"Abstract DNA computing is a highly interdisciplinary field which combines molecular operations with theoretical algorithm design. A number of algorithms have been demonstrated in DNA computing, but to date network flow problems have not been studied. We aim to provide an approach to calculate the value of the maximum flow in networks by encoding the mathematical problem in DNA molecules and by using molecular biology techniques to manipulate the DNA. We present results which demonstrate that the algorithm works for an example network problem. This paper presents the first application of DNA computing to network-flow problems. The presented algorithm has a linear time complexity where the calculation itself is done in a constant number of steps.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"143 ","pages":"483 - 506"},"PeriodicalIF":1.8000,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Foundations of Computing and Decision Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/fcds-2023-0021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Abstract DNA computing is a highly interdisciplinary field which combines molecular operations with theoretical algorithm design. A number of algorithms have been demonstrated in DNA computing, but to date network flow problems have not been studied. We aim to provide an approach to calculate the value of the maximum flow in networks by encoding the mathematical problem in DNA molecules and by using molecular biology techniques to manipulate the DNA. We present results which demonstrate that the algorithm works for an example network problem. This paper presents the first application of DNA computing to network-flow problems. The presented algorithm has a linear time complexity where the calculation itself is done in a constant number of steps.
摘要 DNA 计算是一个高度跨学科的领域，它将分子运算与理论算法设计相结合。DNA 计算中已经展示了许多算法，但迄今为止还没有研究过网络流量问题。我们的目标是提供一种方法，通过将数学问题编码到 DNA 分子中，并利用分子生物学技术来操作 DNA，从而计算网络中的最大流量值。我们展示的结果表明，该算法可用于解决一个网络问题。本文首次将 DNA 计算应用于网络流量问题。本文提出的算法具有线性时间复杂性，计算本身只需一定步数即可完成。
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
