DNA Data Storage Using Reusable Nucleic Acids
AssigneeIntegrated Dna Technologies, Inc.
InventorsJoseph Alan WALDER, Jeffrey A. MANTHEY, William E. MARTIN, III, Shawn ALLEN
Life of this patent
Estimating the term…
Abstract
Disclosed herein are nucleic acid-based data storage systems and nucleic acid data storage constructs comprising reusable nucleic acid sequences, each representing information carried by a single bit (and, in some embodiments, one or more adjacent bits) within a bit string, and each furthermore representing the position of the single bit within the bit string. Also described are methods for storing data in the nucleic acid-based data storage systems and nucleic acid data storage constructs of the disclosure.
Claims22
A method for storing data in a collection of data storage nucleic acids, the method comprising:
- (a) converting the data into a base-B bit string;
- (b) sub-dividing the base-B bit string into y secondary bit strings, and sub-dividing each secondary bit string into x primary bit strings n bits in length;
- (c) for each of x primary bit strings:
- (i) performing one of:
- (A) where B equals 2, such that the base-B bit string is a binary bit string, from a library of n primary data storage nucleic acids, each comprising a single bit-mer sequence, each bit-mer sequence representing a specific position of a primary bit string n bits in length, selecting the primary data storage nucleic acid with the bit-mer sequence for each position of the primary bit string which is a 1, and selecting no primary data storage nucleic acid for each position of the primary bit string which is a 0, wherein each bit-mer sequence is reusable;
- (B) where B equals 2, such that the base-B bit string is a binary bit string, from a library of 2·n primary data storage nucleic acids, each comprising a single bit-mer sequence, each of n bit-mer sequences representing a 1 at a specific position of a primary bit string n bits in length, and each of n other bit-mer sequences representing a 0 at a specific position of the primary bit string, selecting the primary data storage nucleic acid with the 1 bit-mer sequence for each position of the primary bit string which is a 1, and selecting the primary data storage nucleic acid with the 0 bit-mer sequence for each position of the primary bit string which is a 0, wherein each n bit-mer sequence is reusable;
- or
- (C) where B is greater than 2, from a library of B·n primary data storage nucleic acids, each comprising a single bit-mer sequence, each of B·n bit-mer sequences representing a particular base-B digit at a specific position of the primary bit string, selecting the primary data storage nucleic acid with the appropriate bit-mer sequence for each position of the primary bit string, wherein each B·n bit-mer sequence is reusable;
- wherein all primary data storage nucleic acids comprise the same 5′ and 3′ 1° primer binding sequences flanking the bit-mer sequence therein;
- (ii) pooling the selected data storage nucleic acids to form one of x pools of primary data storage nucleic acids storing the data of one of x primary bit strings;
- (iii) using a 1° primer pair that binds to the 5′ and 3′ 1° primer binding sequences to add to each primary data storage nucleic acid the same 5′ and 3′ secondary positional index sequences and, optionally, the same 5′ and 3′ 2° primer binding sequences to produce a pool of secondary data storage nucleic acids,
- wherein each of x pools of secondary data storage nucleic acids comprise different 5′ and 3′ secondary positional index sequences;
- and
- (d) pooling the x pools of secondary data storage nucleic acids corresponding to the x primary bit strings within each of y secondary bit strings into a single pool, to form y pools of secondary data storage nucleic acids, each storing the data of one of y secondary bit strings.
A data storage nucleic acid comprising:
- (a) a reusable bit-mer sequence, which represents information carried by a single bit in a primary bit string, and which further represents a position of the bit within the primary bit string;
- (b) a 5′ secondary positional tag comprising
- (i) a 5′ 1° primer binding sequence flanking the 5′ end of the bit-mer sequence, and
- (ii) a 5′ secondary positional index sequence flanking the 5′ end of the 5′ 1° primer binding sequence;
- and
- (c) a 3′ secondary positional tag comprising
- (i) a 3′ 1° primer binding sequence flanking the 3′ end of the bit-mer sequence, and
- (ii) a 3′ secondary positional index sequence flanking the 3′ end of the 3′ 1° primer binding sequence;
- wherein the 5′ and 3′ secondary positional index sequences represent the position of the primary bit string relative to one or more other primary bit strings within a secondary bit string.
A collection of data storage nucleic acids comprising:
- a plurality of data storage nucleic acids, each data storage nucleic acid comprising one of N different reusable bit-mer sequences,
- wherein each reusable bit-mer sequence represents:
- (a) information carried by a bit in a primary bit string n bits in length and the position p of the bit within the primary bit string, and
- (b) information carried by A adjacent bits in the primary bit string;
- and
- wherein N equals B(A+1)·n where the primary bit string is a base-B bit string, and where each of B(A+1)·n bit-mer sequences represents a base-B digit at a particular position within the primary bit string along with the one or more base-B digits at the positions occupied by the A adjacent bits.
A method for storing data in a collection of data storage nucleic acids, the method comprising:
- (a) converting the data into a base-B bit string;
- (b) sub-dividing the base-B bit string into y secondary bit strings, and sub-dividing each secondary bit string into x primary bit strings n bits in length;
- (c) for each of x primary bit strings:
- (i) from a library of B(A+1)·n primary data storage nucleic acids, each comprising a single reusable bit-mer sequence, each of B(A+1)·n bit-mer sequences representing (1) a particular base-B digit at a specific position p of the primary bit string, in addition to (2) a base-B digit at each of A positions adjacent to position p, selecting the primary data storage nucleic acid with the appropriate bit-mer sequence for each position p of the primary bit string;
- wherein all primary data storage nucleic acids comprise the same 5′ and 3′ 1° primer binding sequences flanking the reusable bit-mer sequence therein;
- (ii) pooling the selected data storage nucleic acids to form one of x pools of primary data storage nucleic acids storing the data of one of x primary bit strings;
- (iii) using a 1° primer pair that binds to the 5′ and 3′ 1° primer binding sequences to add to each primary data storage nucleic acid the same 5′ and 3′ secondary positional index sequences and, optionally, the same 5′ and 3′ 2° primer binding sequences to produce a pool of secondary data storage nucleic acids,
- wherein each of x pools of secondary data storage nucleic acids comprise different 5′ and 3′ secondary positional index sequences;
- and
- (d) pooling the x pools of secondary data storage nucleic acids corresponding to the x primary bit strings within each of y secondary bit strings into a single pool, to form y pools of secondary data storage nucleic acids, each storing the data of one of y secondary bit strings.
Dependencies are inferred from the claim text.