Abstract
Download Conference Presentation
High value data like historical or health records, seismic or satellite images, particle collision events or original recordings, require a long-term storage medium that is resilient, scalable, secure, and computable. DNA has been proposed as a solution and storage has been demonstrated using basewise synthesis. Separately, DNA computing demonstrations have shown complex programs executed on toy datasets. Here, we demonstrate a new unified approach to DNA-based data storage and computing. We propose a novel combinatorial assembly approach to writing data into DNA. We define a tree-like DNA data structure and use it to write data in key-value form. We demonstrate our approach by writing The Complete Works of William Shakespeare — about one million words of text — into DNA with raw error rates rivaling conventional media. Leveraging our DNA data structure, we define two new computing instructions — select and extract — and using them, demonstrate how DNA-encoded text could be searched for exact or approximate matches to a query word. Our search demonstrations achieve perfect recall and high precision. Our approach is more scalable in cost and throughput than previous approaches and our platform is extensible to more powerful computing instructions.