Back

Brownian DNA Computing

Schröder, T.; Bauer, J.; Schüler, P.; Zähringer, J.; Cole, F.; Ferrari, G.; Barnard, L.; Gronbach, K.; Brüggenthies, G. A.; Tinnefeld, P.

2025-08-23 biophysics
10.1101/2025.08.21.671330 bioRxiv
Show abstract

Silicon-based computing faces limitations in energy consumption, parallelism and the possibility to interact with living systems, prompting interest in biomolecular alternatives such as DNA computing. Here we present Brownian DNA computing that uses coupled molecular balances to form a molecular processing unit (MPU) on a DNA origami platform. The designed MPUs perform Boolean logic operations of increasing complexity including a half-adder and multiple-input gates. Distinguishing different inputs by the intensity of single-molecule probes reporting on the state of the MPU enables non-Boolean logic with two-input four-output operations directly integrating all basic logic operations in a single computational gate. The presented Brownian DNA computing approach may offer energy-efficient computation and serve as a foundation for molecular computing, sensing, and soft robotics.

Matching journals

The top 5 journals account for 50% of the predicted probability mass.

50% of probability mass above

"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.