Die DPG-Frühjahrstagung in Dresden musste abgesagt werden! Lesen Sie mehr ...
Bereiche | Tage | Auswahl | Suche | Aktualisierungen | Downloads | Hilfe
BP: Fachverband Biologische Physik
BP 19: Poster VII
BP 19.6: Poster
Dienstag, 17. März 2020, 14:00–16:00, P2/3OG
Parallel Network-Based Biocomputation using molecular motors- Solving Exact cover — •Pradheebha Surendiran1, Aseem Salhotra2, Till Korten3, Alf Månsson2, and Heiner Linke1 — 1Nanolund and Solid state physics, Lund university, Lund, Sweden — 2Department of chemistry and biomedical sciences, Linnaeus university, Kalmar, Sweden — 3B-cube, Centre for molecular bioengineering, Technische universität Dresden, Dresden, Germany
Computational problems of a combinatorial nature requires exponential time to explore the solution, making traditional serial computation intractable, and parallel computation a necessity. The subset sum problem was recently solved [1] encoding them into a graphical network of channels ingrained onto a nanofabricated device which was then explored by molecular motors to find all possible solutions to the problem. This approach of network based parallel-computation (NBC) could be potentially used to solve other problems by scaling in an energy efficient manner compared to that of the conventional computer. In this work, we focus on solving Exact Cover(ExCov) which is a decision problem applying the same strategy. We fabricate the problem encoded nanodevice with upscaled network of channels and observe the motility of molecular motors using fluorescence microscopy. Thus scaling of these devices has led to the interest of developing different architectural elements and also employ methods such as deep learning for the automatic evaluation of the huge amount of data obtained. [1] Nicolau et al, PNAS 113 (10), 2591-2596 (2016) Funding: EC-H2020 Bio4Comp Grant-No. 732482