Pradheebha Surendiran, Christoph Robert Meinecke, Aseem Salhotra, Georg Heldt, Jingyuan Zhu, Alf Månsson, Stefan Diez, Danny Reuter, Hillel Kugler, Heiner Linke and Till Korten*,
{"title":"用分子马达驱动的基于网络的生物计算求解精确覆盖实例","authors":"Pradheebha Surendiran, Christoph Robert Meinecke, Aseem Salhotra, Georg Heldt, Jingyuan Zhu, Alf Månsson, Stefan Diez, Danny Reuter, Hillel Kugler, Heiner Linke and Till Korten*, ","doi":"10.1021/acsnanoscienceau.2c00013","DOIUrl":null,"url":null,"abstract":"<p >Information processing by traditional, serial electronic processors consumes an ever-increasing part of the global electricity supply. An alternative, highly energy efficient, parallel computing paradigm is network-based biocomputation (NBC). In NBC a given combinatorial problem is encoded into a nanofabricated, modular network. Parallel exploration of the network by a very large number of independent molecular-motor-propelled protein filaments solves the encoded problem. Here we demonstrate a significant scale-up of this technology by solving four instances of Exact Cover, a nondeterministic polynomial time (NP) complete problem with applications in resource scheduling. The difficulty of the largest instances solved here is 128 times greater in comparison to the current state of the art for NBC.</p>","PeriodicalId":29799,"journal":{"name":"ACS Nanoscience Au","volume":"2 5","pages":"396–403"},"PeriodicalIF":4.8000,"publicationDate":"2022-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9585575/pdf/","citationCount":"4","resultStr":"{\"title\":\"Solving Exact Cover Instances with Molecular-Motor-Powered Network-Based Biocomputation\",\"authors\":\"Pradheebha Surendiran, Christoph Robert Meinecke, Aseem Salhotra, Georg Heldt, Jingyuan Zhu, Alf Månsson, Stefan Diez, Danny Reuter, Hillel Kugler, Heiner Linke and Till Korten*, \",\"doi\":\"10.1021/acsnanoscienceau.2c00013\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p >Information processing by traditional, serial electronic processors consumes an ever-increasing part of the global electricity supply. An alternative, highly energy efficient, parallel computing paradigm is network-based biocomputation (NBC). In NBC a given combinatorial problem is encoded into a nanofabricated, modular network. Parallel exploration of the network by a very large number of independent molecular-motor-propelled protein filaments solves the encoded problem. Here we demonstrate a significant scale-up of this technology by solving four instances of Exact Cover, a nondeterministic polynomial time (NP) complete problem with applications in resource scheduling. The difficulty of the largest instances solved here is 128 times greater in comparison to the current state of the art for NBC.</p>\",\"PeriodicalId\":29799,\"journal\":{\"name\":\"ACS Nanoscience Au\",\"volume\":\"2 5\",\"pages\":\"396–403\"},\"PeriodicalIF\":4.8000,\"publicationDate\":\"2022-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9585575/pdf/\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACS Nanoscience Au\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://pubs.acs.org/doi/10.1021/acsnanoscienceau.2c00013\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"NANOSCIENCE & NANOTECHNOLOGY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACS Nanoscience Au","FirstCategoryId":"1085","ListUrlMain":"https://pubs.acs.org/doi/10.1021/acsnanoscienceau.2c00013","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"NANOSCIENCE & NANOTECHNOLOGY","Score":null,"Total":0}
Solving Exact Cover Instances with Molecular-Motor-Powered Network-Based Biocomputation
Information processing by traditional, serial electronic processors consumes an ever-increasing part of the global electricity supply. An alternative, highly energy efficient, parallel computing paradigm is network-based biocomputation (NBC). In NBC a given combinatorial problem is encoded into a nanofabricated, modular network. Parallel exploration of the network by a very large number of independent molecular-motor-propelled protein filaments solves the encoded problem. Here we demonstrate a significant scale-up of this technology by solving four instances of Exact Cover, a nondeterministic polynomial time (NP) complete problem with applications in resource scheduling. The difficulty of the largest instances solved here is 128 times greater in comparison to the current state of the art for NBC.
期刊介绍：
ACS Nanoscience Au is an open access journal that publishes original fundamental and applied research on nanoscience and nanotechnology research at the interfaces of chemistry biology medicine materials science physics and engineering.The journal publishes short letters comprehensive articles reviews and perspectives on all aspects of nanoscience and nanotechnology:synthesis assembly characterization theory modeling and simulation of nanostructures nanomaterials and nanoscale devicesdesign fabrication and applications of organic inorganic polymer hybrid and biological nanostructuresexperimental and theoretical studies of nanoscale chemical physical and biological phenomenamethods and tools for nanoscience and nanotechnologyself- and directed-assemblyzero- one- and two-dimensional materialsnanostructures and nano-engineered devices with advanced performancenanobiotechnologynanomedicine and nanotoxicologyACS Nanoscience Au also publishes original experimental and theoretical research of an applied nature that integrates knowledge in the areas of materials engineering physics bioscience and chemistry into important applications of nanomaterials.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
