US 12,277,999 B2
Re-writable DNA-based digital storage with random access
Olgica Milenkovic, Urbana, IL (US); S. M. Hossein Tabatabaei Yazdi, Urbana, IL (US); Yongbo Yuan, Urbana, IL (US); Jian Ma, Urbana, IL (US); and Huimin Zhao, Champaign, IL (US)
Assigned to The Board of Trustees of The University of Illinois, Urbana, IL (US)
Filed by The Board of Trustees of the University of Illinois, Urbana, IL (US)
Filed on Oct. 15, 2019, as Appl. No. 16/653,564.
Application 16/653,564 is a continuation of application No. 15/356,118, filed on Nov. 18, 2016, granted, now 10,566,077.
Claims priority of provisional application 62/257,273, filed on Nov. 19, 2015.
Prior Publication US 2020/0035331 A1, Jan. 30, 2020
This patent is subject to a terminal disclaimer.
Int. Cl. G16B 50/00 (2019.01); B01J 19/00 (2006.01); G16B 25/20 (2019.01)
CPC G16B 50/00 (2019.02) [B01J 19/0046 (2013.01); G16B 25/20 (2019.02); B01J 2219/0059 (2013.01); B01J 2219/00596 (2013.01); B01J 2219/00722 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A method comprising:
reading, by way of random access, a physical nucleotide sequence of 2n+L bases to form a digital representation of the physical nucleotide sequence, wherein the reading involves amplifying the physical nucleotide sequence and sequencing the physical nucleotide sequence;
dividing the digital representation of the physical nucleotide sequence into an address representation of n bases, followed by a data representation of L bases, followed by a further address representation of n bases, wherein the address representation and the further address representation each are uncorrelated with one another, self-uncorrelated, and end with a particular base;
decoding the data representation into an integer value less than 3L that is a sum of a first addend and a second addend, wherein the data representation includes a first subsequence of bases encoding the first addend followed by a second subsequence of bases encoding the second addend, wherein the first addend is encoded based on mappings of subvalues of the first addend to n sets of bases respectively associated with the n bases of the address representation, wherein the second subsequence of bases is a ternary encoding of the second addend over a set of three bases not including the particular base, and wherein the data representation is uncorrelated with each of the address representation and the further address representation; and
storing, in a computer memory, the integer value.