Random Access DNA Registers

Abstract

Recent advancements in DNA-based data storage have primarily focused on maximizing data density, often at the expense of operational flexibility. Traditional encoding schemes require complete resequencing for data modification, while current computational approaches rely on slow reaction primitives. This research addresses the need for an error-resistant system that enables complex computational tasks directly on DNA without compromising local random access memory operations. We propose a novel encoding strategy that stores data in individual register strands. Each register strand encodes both the value and address of the data in two functionally separate subsequences, providing additional parameters to control error accumulation during operations. Simulation results demonstrate that the system can selectively retrieve individual register strands, enabling the precise modification of single values. It can also perform logical AND operations to compute across adjacent stored values. These operations facilitate the transfer of stored data from one system to another. This capability suggests that a modular network of systems could potentially scale to achieve the highly parallel computation required to overcome the inherently slow operation speed of DNA computing.