Affiliation:
1. University of Washington, Seattle, WA, USA
2. Microsoft Research, Redmond, WA, USA
Abstract
Demand for data storage is growing exponentially, but the capacity of existing storage media is not keeping up. Using DNA to archive data is an attractive possibility because it is extremely dense, with a raw limit of 1 exabyte/mm
3
(109 GB/mm
3
), and long-lasting, with observed half-life of over 500 years. This paper presents an architecture for a DNA-based archival storage system. It is structured as a key-value store, and leverages common biochemical techniques to provide random access. We also propose a new encoding scheme that offers controllable redundancy, trading off reliability for density. We demonstrate feasibility, random access, and robustness of the proposed encoding with wet lab experiments involving 151 kB of synthesized DNA and a 42 kB random-access subset, and simulation experiments of larger sets calibrated to the wet lab experiments. Finally, we highlight trends in biotechnology that indicate the impending practicality of DNA storage for much larger datasets.
Funder
National Science Foundation
Publisher
Association for Computing Machinery (ACM)
Reference29 articles.
1. The half-life of DNA in bone: measuring decay kinetics in 158 dated fossils
2. Long-term storage of information;Bancroft C.;DNA. Science,2001
3. R. Carlson. Time for new DNA synthesis and sequencing cost curves. http://www.synthesis.cc/2014/02/time-for-new-cost-curves-2014.html 2014. R. Carlson. Time for new DNA synthesis and sequencing cost curves. http://www.synthesis.cc/2014/02/time-for-new-cost-curves-2014.html 2014.
4. Programmable chemical controllers made from DNA
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Cost-effective DNA storage with DNA movable type;2024-07-19
2. DNA Archives: Revolutionizing Data Storage;2023 3rd International Conference on Innovative Mechanisms for Industry Applications (ICIMIA);2023-12-21
3. Levenshtein’s Reconstruction Problem with Different Error Patterns;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25
4. Improved Upper and Lower Bounds on the Capacity of the Binary Deletion Channel;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25
5. Reed Solomon Codes Against Adversarial Insertions and Deletions;IEEE Transactions on Information Theory;2023-05