DNA Fountain enables a robust and efficient storage architecture
Open Access
- 3 March 2017
- journal article
- other
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 355 (6328), 950-954
- https://doi.org/10.1126/science.aaj2038
Abstract
DNA is an attractive medium to store digital information. Here we report a storage strategy, called DNA Fountain, that is highly robust and approaches the information capacity per nucleotide. Using our approach, we stored a full computer operating system, movie, and other files with a total of 2.14 × 106 bytes in DNA oligonucleotides and perfectly retrieved the information from a sequencing coverage equivalent to a single tile of Illumina sequencing. We also tested a process that can allow 2.18 × 1015 retrievals using the original DNA sample and were able to perfectly decode the data. Finally, we explored the limit of our architecture in terms of bytes per molecule and obtained a perfect retrieval from a density of 215 petabytes per gram of DNA, orders of magnitude higher than previous reports.Keywords
This publication has 32 references indexed in Scilit:
- Characterizing and measuring bias in sequence dataGenome Biology, 2013
- Accurate gene synthesis with tag-directed retrieval of sequence-verified DNA moleculesNature Methods, 2012
- Not All Sequence Tags Are Created Equal: Designing and Validating Sequence Identification Tags Robust to IndelsPLOS ONE, 2012
- Efficiency, error and yield in light-directed maskless synthesis of DNA microarraysJournal of Nanobiotechnology, 2011
- Efficient study design for next generation sequencingGenetic Epidemiology, 2011
- Quake: quality-aware detection and correction of sequencing errorsGenome Biology, 2010
- Scalable gene synthesis by selective amplification of DNA pools from high-fidelity microchipsNature Biotechnology, 2010
- Phenotypic connections in surprising placesGenome Biology, 2010
- DNA Sudoku—harnessing high-throughput sequencing for multiplexed specimen analysisGenome Research, 2009
- Waiting Time Distributions of Simple and Compound Patterns in a Sequence of r-th Order Markov Dependent Multi-state TrialsAnnals of the Institute of Statistical Mathematics, 2006