A Rewritable, Random-Access DNA-Based Storage System

Scientific Reports

Volumn 5, Issue , 2015, Pages

  Tabatabaei Yazdi, S M Hossein ^a   Yuan, Yongbo ^b   Ma, Jian ^a,b   Zhao, Huimin ^b   Milenkovic, Olgica ^a  

^a University of Illinois at Urbana Champaign   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DNA;

ALGORITHM; CHEMISTRY; GENETICS; INFORMATION RETRIEVAL; INFORMATION SCIENCE; TECHNOLOGY; THEORETICAL MODEL;

ALGORITHMS; DNA; INFORMATION SCIENCE; INFORMATION STORAGE AND RETRIEVAL; MODELS, THEORETICAL; TECHNOLOGY;

EID: 84942046934     PISSN: None     EISSN: 20452322     Source Type: Journal    
DOI: 10.1038/srep14138     Document Type: Article

References (22)

1. Bancroft, C., Bowler, T., Bloom, B. &Clelland, C. T. Long-term storage of information in dna. Science (New York, NY) 293, 1763-1765 (2001).
2. Davis, J. Microvenus. Art Journal 55, 70-74 (1996).
3. Church, G. M., Gao, Y. & Kosuri, S. Next-generation digital information storage in dna. Science 337, 1628-1628 (2012).
4. Goldman, N. et al. Towards practical, high-capacity, low-maintenance information storage in synthesized dna. Nature (2013).
5. Grass, R. N., Heckel, R., Puddu, M., Paunescu, D. & Stark, W. J. Robust chemical preservation of digital information on dna in silica with error-correcting codes. Angewandte Chemie International Edition 54, 2552-2555 (2015).
6. Ross, M. G. et al. Characterizing and measuring bias in sequence data. Genome Biol 14, R51 (2013).
7. Cohen, G. D. & Litsyn, S. Dc-constrained error-correcting codes with small running digital sum. Information Theory, IEEE Transactions on 37, 949-955 (1991).
8. Blaum, M., Litsyn, S., Buskens, V. & van Tilborg, H. C. Error-correcting codes with bounded running digital sum. IEEE transactions on information theory 39, 216-227 (1993).
9. Gilbert, E. Synchronization of binary messages. Information Theory, IRE Transactions on 6, 470-477 (1960).
10. Packer, H. CRISPR and Cas9 for flexible genome editing. Technical report. (2014) Available at: www.idtdna.com/pages/products/genes/gblocks-gene-fragments/decoded-articles/decoded/2013/12/13/crispr-and-cas9-for-flexible-genome-editing. (Accessed: 1th January 2015).
11. Bryksin, A. V. & Matsumura, I. Overlap extension PCR cloning: a simple and reliable way to create recombinant plasmids. Biotechniques 48, 463 (2010).
12. Schuster, S. C. Next-generation sequencing transforms today's biology. Nature methods 5, 16-18 (2008).
13. Immink, K. A. S. Codes for mass data storage systems (Shannon Foundation Publisher, 2004).
14. Morita, H., van Wijngaarden, A. J. & Han Vinck, A. On the construction of maximal prefix-synchronized codes. Information Theory, IEEE Transactions on 42, 2158-2166 (1996).
15. Milenkovic, O. & Kashyap, N. On the design of codes for dna computing. In Coding and Cryptography, 100-119 (Springer, 2006).
16. Rouillard, J.-M., Zuker, M. & Gulari, E. Oligoarray 2.0: design of oligonucleotide probes for dna microarrays using a thermodynamic approach. Nucleic acids research 31, 3057-3062 (2003).
17. Guibas, L. J. & Odlyzko, A. M. Maximal prefix-synchronized codes. SIAM Journal on Applied Mathematics 35, 401-418 (1978).
18. Massey, J. L. Optimum frame synchronization. Communications, IEEE Transactions on 20, 115-119 (1972).
19. Bajic, D. On construction of cross-bifix-free kernel sets. Cryptography and Communications archive 6, 27-37 (2014).
20. Chee, Y. M., Kiah, H. M., Purkayastha, P. & Wang, C. Cross-bifix-free codes within a constant factor of optimality. Information Theory, IEEE Transactions on 59, 4668-4674 (2013).
21. Blackburn, S. R. Non-overlapping codes. arXiv preprint arXiv:1303.1026 (2013).
22. Berman, P. & Fürer, M. Approximating maximum independent set in bounded degree graphs. In SODA, vol. 94, 365-371 (1994).