Scaling logical density of DNA storage with enzymatically-ligated composite motifs

DNA is a promising candidate for long-term data storage due to its high density and endurance. The key challenge in DNA storage today is the cost of synthesis. In this work, we propose composite motifs , a framework that uses a mixture of prefabricated motifs as building blocks to reduce synthesis c...

Full description

Saved in:
Bibliographic Details
Published in:Scientific reports 2023-09, Vol.13 (1), p.15978-15978, Article 15978
Main Authors: Yan, Yiqing, Pinnamaneni, Nimesh, Chalapati, Sachin, Crosbie, Conor, Appuswamy, Raja
Format: Article
Language:English
Subjects:
631/553/117
631/553/552
631/61
Data storage
Deoxyribonucleic acid
Design
DNA
Efficiency
Humanities and Social Sciences
multidisciplinary
Nucleotide sequence
Oligonucleotides
Science
Science (multidisciplinary)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:DNA is a promising candidate for long-term data storage due to its high density and endurance. The key challenge in DNA storage today is the cost of synthesis. In this work, we propose composite motifs , a framework that uses a mixture of prefabricated motifs as building blocks to reduce synthesis cost by scaling logical density. To write data, we introduce Bridge Oligonucleotide Assembly, an enzymatic ligation technique for synthesizing oligos based on composite motifs. To sequence data, we introduce Direct Oligonucleotide Sequencing, a nanopore-based technique to sequence short oligos, eliminating common preparatory steps like DNA assembly, amplification and end-prep. To decode data, we introduce Motif-Search, a novel consensus caller that provides accurate reconstruction despite synthesis and sequencing errors. Using the proposed methods, we present an end-to-end experiment where we store the text “HelloWorld” at a logical density of 84 bits/cycle (14–42× improvement over state-of-the-art).
ISSN:2045-2322
2045-2322
DOI:10.1038/s41598-023-43172-0