Harvard cracks DNA storage, crams 700 terabytes of data into a single gram
1–10 of 133 posts
Re: Harvard cracks DNA storage, crams 700 terabytes of data into a single gram
#2 T = 00
G = 01
A = 10
C = 11
for example.Re: Harvard cracks DNA storage, crams 700 terabytes of data into a single gram
#3They're using T and G for a 1, and A and C for a 0; why not double the density and get two bits from each letter? T = 00 G = 01 A = 10 C = 11 for example.
Re: Harvard cracks DNA storage, crams 700 terabytes of data into a single gram
#4Re: Harvard cracks DNA storage, crams 700 terabytes of data into a single gram
#5Re: Harvard cracks DNA storage, crams 700 terabytes of data into a single gram
#6They're using T and G for a 1, and A and C for a 0; why not double the density and get two bits from each letter? T = 00 G = 01 A = 10 C = 11 for example.
Base pairs. They don't occur individually.
AT = 00
TA = 01
CG = 10
GC = 11
The trick would be to always correctly identify which is the left and which is the right strand. I don't know if that is possible in practice though.
Re: Harvard cracks DNA storage, crams 700 terabytes of data into a single gram
#7It is incredibly stable? We better don't tell evolution.
Re: Harvard cracks DNA storage, crams 700 terabytes of data into a single gram
#8It is incredibly stable? We better don't tell evolution.
Error correction redundancy to any level of reliability you want takes log(N) extra storage. My question would be what the access speeds are. If you have to read it by running it through a trillion PCR test tubes, this isn't exactly practical.
Re: Harvard cracks DNA storage, crams 700 terabytes of data into a single gram
#9It is incredibly stable? We better don't tell evolution.
Re: Harvard cracks DNA storage, crams 700 terabytes of data into a single gram
#10Earlier quoted context omitted.
Base pairs. They don't occur individually.
IANA DNA expert, but they still seem to be ordered [1]. So a possible scheme to increase data density could be: AT = 00 TA = 01 CG = 10 GC = 11 The trick would be to always correctly identify which is the left and which is the right strand. I don't know if that is possible in practice though. [1] http://en.wikipedia.org/wiki/Base_pair#Examples
You just encode a big marker (making sure it's not a palindrome-paired version of itself!) as a header. If you see that, it's a correct order. If not, it's not.