Solving Exact Cover Instances with Molecular-Motor-Powered Network-Based Biocomputation

ACS Nanosci Au. 2022 Oct 19;2(5):396-403. doi: 10.1021/acsnanoscienceau.2c00013. Epub 2022 Jun 23.


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.