Nucleic acid-based data storage

By using combinatorial strategies and enzyme-based editing to encode digital information in nucleic acid sequences, the method addresses the inefficiencies and high costs of existing nucleic acid digital data storage technologies, providing a more efficient and cost-effective solution for data storage and retrieval.

JP7586880B2Active Publication Date: 2024-11-19CATALOG TECHNOLOGIES INC
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
JP2022182278
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Priority Date
2017-03-02
Filing Date
2022-11-15
Publication Date
2024-11-19
Estimated Expiration
2037-11-16

AI Technical Summary

Technical Problem

Current methods for nucleic acid digital data storage are expensive and error-prone due to the reliance on base-by-base nucleic acid synthesis, making them inefficient and costly for encoding and retrieving data.

Method used

A method for encoding digital information in nucleic acid sequences by specifying bit locations with unique nucleic acid sequences, using combinatorial strategies and enzyme-based editing to construct identifiers without base-by-base synthesis, allowing for efficient and cost-effective data storage and retrieval.

Benefits of technology

This approach reduces the need for de novo nucleic acid synthesis, lowers costs, and enhances the speed and accuracy of data storage and retrieval, making nucleic acid-based data storage more commercially viable.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007586880000001
    Figure 0007586880000001
  • Figure 0007586880000002
    Figure 0007586880000002
  • Figure 0007586880000003
    Figure 0007586880000003
Patent Text Reader

Abstract

Providing nucleic acid-based data storage [Solution] Methods and systems for encoding digital information in nucleic acid (e.g., deoxyribonucleic acid) molecules without base-by-base synthesis by encoding bit value information in the presence or absence of unique nucleic acid sequences in a pool, including designating each bit location in the bit stream with a unique nucleobase sequence and designating the bit value at that location by the presence or absence of a corresponding unique nucleic acid sequence in the pool, or more generally, designating a unique byte in the byte stream by a unique subset of nucleic acid sequences. Also disclosed are methods for generating unique nucleic acid sequences without base-by-base synthesis using combinatorial genomic strategies (e.g., assembly of multiple nucleic acid sequences or enzyme-based editing of nucleic acid sequences).
Need to check novelty before this filing date? Find Prior Art

Description

[Technical Field]

[0001] cross reference This application claims the benefit of U.S. Provisional Patent Application No. 62 / 423,058, filed November 16, 2016, U.S. Provisional Patent Application No. 62 / 457,074, filed February 9, 2017, and U.S. Provisional Patent Application No. 62 / 466,304, filed March 2, 2017, each of which is incorporated herein by reference in its entirety. [Background technology]

[0002] background Nucleic acid digital data storage is a stable technique for encoding and storing information over long periods of time, and data is stored at higher densities than magnetic tape or hard drive storage systems. Additionally, digital data stored in nucleic acid molecules stored in low-temperature, dry conditions can be retrieved for 60,000 years or longer.

[0003] To access the digital data stored within a nucleic acid molecule, the nucleic acid molecule can be sequenced. Thus, nucleic acid digital data storage can be an ideal method for storing data that is not accessed frequently but may contain large amounts of information to be stored or archived for long periods of time.

[0004] Current methods rely on encoding digital information (e.g., binary code) into base-by-base nucleic acid sequences such that the base-to-base relationships within the sequence translate directly into digital information (e.g., binary code). Sequencing of digital data stored in base-by-base sequences that can be read into bitstreams or bytes of digitally encoded information can be error-prone and expensive to encode because the cost of de novo base-by-nucleotide synthesis can be expensive. Opportunities for new methods of implementing nucleic acid digital data storage may provide inexpensive and commercially easy to implement approaches for encoding and retrieving data. Summary of the Invention [Means for solving the problem]

[0005] Abstract Methods and systems for encoding digital information in nucleic acid (e.g., deoxyribonucleic acid, DNA) molecules without base-by-base synthesis by encoding bit value information in the presence or absence of unique nucleic acid sequences in a pool, including designating each bit location in the bit stream with a unique nucleic acid sequence and designating the bit value at that location by the presence or absence of a corresponding unique nucleic acid sequence in the pool. However, more generally, designating unique bytes in a byte stream by unique subsets of nucleic acid sequences. Methods for generating unique nucleic acid sequences without base-by-base synthesis using combinatorial genomic strategies (e.g., assembly of multiple nucleic acid sequences or enzyme-based editing of nucleic acid sequences) are also disclosed.

[0006] In one aspect, the disclosure provides a method for writing information into a nucleic acid sequence, the method comprising: (a) translating the information into a string of symbols; (b) mapping the string of symbols to a plurality of identifiers, wherein each identifier of the plurality of identifiers comprises one or more components, each component of the one or more components comprising a nucleic acid sequence, and each identifier of the plurality of identifiers corresponds to an individual symbol of the string of symbols; and (c) constructing an identifier library comprising at least a subset of the plurality of identifiers.

[0007] In some embodiments, each symbol in the string of symbols is one of two possible symbol values. In some embodiments, one symbol value at each position in the string of symbols may be represented by the absence of a distinct identifier in the identifier library. In some embodiments, the two possible symbol values ​​are bit values ​​of 0 and 1, and an individual symbol in the string of symbols with a bit value of 0 may be represented by the absence of a distinct identifier in the identifier library, and an individual symbol in the string of symbols with a bit value of 1 may be represented by the presence of a distinct identifier in the identifier library, or vice versa. In some embodiments, each symbol in the string of symbols is one of one or more possible symbol values. In some embodiments, the presence of an individual identifier in the identifier library corresponds to a first symbol value in the binary string, and the absence of an individual identifier corresponds to a second symbol value in the binary string. In some embodiments, the first symbol value is a bit value of 1 and the second symbol value is a bit value of 0. In some embodiments, the first symbol value is a bit value of 0 and the second symbol value is a bit value of 1.

[0008] In some embodiments, constructing individual identifiers in the identifier library includes assembling one or more components from one or more layers, each layer of the one or more layers including a distinct set of components. In some embodiments, an individual identifier from the identifier library includes one component from each layer of the one or more layers. In some embodiments, the one or more components are assembled in a fixed order. In some embodiments, the one or more components are assembled in a random order. In some embodiments, the one or more components are assembled with one or more partition components interposed between two components from different layers of the one or more layers. In some embodiments, an individual identifier includes one component from each layer of a subset of the one or more layers. In some embodiments, an individual identifier includes at least one component from each of the one or more layers. In some embodiments, the one or more components are assembled using overlap-extension polymerase chain reaction (PCR), polymerase cycling assembly, sticky-end ligation, BioBrick assembly, Golden Gate assembly, Gibson assembly, recombinase assembly, ligase cycling reaction, or template-directed ligation.

[0009] In some embodiments, constructing individual identifiers in the identifier library includes deleting, replacing, or inserting at least one component within the parent identifier by applying a nucleic acid editing enzyme to the parent identifier. In some embodiments, the parent identifier includes nuclease-specific target sites, recombinase recognition sites, or multiple components flanked by separate spacer sequences. In some embodiments, the nucleic acid editing enzyme is selected from the group consisting of CRISPR-Cas, TALEN, zinc finger nuclease, recombinase, and functional variants thereof.

[0010] In some embodiments, the identifier library comprises a plurality of nucleic acid sequences. In some embodiments, the plurality of nucleic acid sequences stores metadata of the information and / or hides the information. In some embodiments, the metadata comprises secondary information corresponding to the source of the information, the intended recipient of the information, the original format of the information, the instrumentation and methods used to encode the information, the date and time of writing the information to the identifier library, modifications made to the information, and / or references to other information.

[0011] In some embodiments, one or more identifier libraries are combined, and each identifier library of the one or more identifier libraries is tagged with a separate barcode. In some embodiments, each individual identifier in an identifier library comprises a separate barcode. In some embodiments, the multiple identifiers are selected to simplify read, write, access, copy, and delete operations. In some embodiments, the multiple identifiers are selected to minimize write errors, mutations, degradation, and read errors.

[0012] In another aspect, the disclosure provides a method for copying information encoded in a nucleic acid sequence, the method comprising: (a) providing an identifier library encoding a string of symbols, the identifier library comprising a plurality of identifiers, each identifier of the plurality of identifiers comprising one or more components, each component of the one or more components comprising a nucleic acid sequence, each identifier of the plurality of identifiers corresponding to an individual symbol of the string of symbols; and (b) constructing one or more copies of the identifier library.

[0013] In some embodiments, the plurality of identifiers comprises one or more primer binding sites. In some embodiments, the identifier library is copied using polymerase chain reaction (PCR). In some embodiments, the PCR is conventional PCR or linear PCR, where the number of copies of the identifier library doubles or linearly increases with each PCR cycle, respectively. In some embodiments, individual identifiers in the identifier library are ligated into a circular vector prior to PCR, where the circular vector comprises a barcode at each end of the individual identifiers.

[0014] In some embodiments, the identifier library comprises a plurality of nucleic acid sequences. In some embodiments, the plurality of nucleic acid sequences are copied. In some embodiments, the one or more identifier libraries are combined prior to copying, and each library of the one or more identifier libraries comprises a distinct barcode.

[0015] In another aspect, the disclosure provides a method for accessing information encoded in a nucleic acid sequence, the method comprising: (a) providing an identifier library encoding a string of symbols, the identifier library comprising a plurality of identifiers, each identifier of the plurality of identifiers comprising one or more components, each component of the one or more components comprising a nucleic acid sequence, each identifier of the plurality of identifiers corresponding to an individual symbol of the string of symbols; and (b) extracting a targeted subset of the plurality of identifiers from the identifier library.

[0016] In some embodiments, the plurality of probes are combined with an identifier library. In some embodiments, the plurality of probes share complementarity with a target subset of the plurality of identifiers from the identifier library. In some embodiments, the plurality of probes hybridize with a target subset of the plurality of identifiers in the identifier library. In some embodiments, the plurality of probes comprise one or more affinity tags, and the one or more affinity tags are captured by affinity beads or affinity columns.

[0017] In some embodiments, the identifier library is sequentially combined with one or more subsets of the plurality of probes, and a portion of the identifier library binds to one or more subsets of the plurality of probes, hi some embodiments, the portion of the identifier library that binds to one or more subsets of the plurality of probes is removed prior to adding another subset of the plurality of probes to the identifier library.

[0018] In some embodiments, each identifier in the plurality of identifiers comprises one or more common primer binding regions, one or more variable primer binding regions, or any combination thereof. In some embodiments, the identifier library is combined with primers that bind to one or more common primer binding regions or to one or more variable primer binding regions. In some embodiments, primers that bind to one or more variable primer binding regions are used to selectively amplify a target subset of the identifier library.

[0019] In some embodiments, a portion of the identifiers are removed from the identifier library by selective nuclease cleavage. In some embodiments, the identifier library is combined with Cas9 and a guide probe, and the guide probe guides Cas9 to remove specified identifiers from the identifier library. In some embodiments, the individual identifiers are single-stranded, and the identifier library is combined with a single-strand-specific endonuclease. In some embodiments, the identifier library is mixed with a complementary set of individual identifiers that protect the target individual identifiers from degradation before the addition of the single-strand-specific endonuclease. In some embodiments, the individual identifiers that are not cleaved by the selective nuclease cleavage are separated by size-selective chromatography. In some embodiments, the individual identifiers that are not cleaved by the selective nuclease cleavage are amplified, and the individual identifiers that are cleaved by the selective nuclease cleavage are not amplified. In some embodiments, the identifier library comprises a plurality of nucleic acid sequences, and the plurality of nucleic acid sequences is extracted with a target subset of the plurality of identifiers in the identifier library.

[0020] In another aspect, the disclosure provides a method for reading information encoded in a nucleic acid sequence, the method including: (a) providing an identifier library comprising a plurality of identifiers, wherein each identifier of the plurality of identifiers comprises one or more components, and each component of the one or more components comprises a nucleic acid sequence; (b) identifying the plurality of identifiers in the identifier library; (c) generating a plurality of symbols from the plurality of identifiers identified in (b), wherein each individual symbol of the plurality of symbols corresponds to an individual identifier of the plurality of identifiers; and (d) compiling information from the plurality of symbols.

[0021] In some embodiments, each symbol in the string of symbols is one of two possible symbol values. In some embodiments, one symbol value at each position in the string of symbols may be represented by the absence of a distinct identifier in the identifier library. In some embodiments, the two possible symbol values ​​are bit values ​​of 0 and 1, and an individual symbol in the string of symbols with a bit value of 0 may be represented by the absence of a distinct identifier in the identifier library, and an individual symbol in the string of symbols with a bit value of 1 may be represented by the presence of a distinct identifier in the identifier library, or vice versa. In some embodiments, the presence of an individual identifier in the identifier library corresponds to a first symbol value in the binary string, and the absence of an individual identifier in the identifier library corresponds to a second symbol value in the binary string. In some embodiments, the first symbol value is a bit value of 1 and the second symbol value is a bit value of 0. In some embodiments, the first symbol value is a bit value of 0 and the second symbol value is a bit value of 1.

[0022] In some embodiments, identifying the plurality of identifiers comprises sequencing the plurality of identifiers in an identifier library. In some embodiments, the sequencing comprises digital polymerase chain reaction (PCR), quantitative PCR, microarray, sequencing-by-synthesis, or massively parallel sequencing. In some embodiments, the identifier library comprises a plurality of nucleic acid sequences. In some embodiments, the plurality of nucleic acid sequences store information metadata and / or conceal information. In some embodiments, one or more identifier libraries are combined, and each identifier library in the one or more identifier libraries comprises a distinct barcode. In some embodiments, the barcode stores information metadata.

[0023] In another aspect, the disclosure provides a method for nucleic acid-based computer data storage, the method including: (a) receiving computer data; (b) synthesizing nucleic acid molecules comprising a nucleic acid sequence encoding the computer data, wherein the computer data is encoded within at least a subset of the nucleic acid molecules that are not within each sequencing of the synthesized nucleic acid molecules; and (c) storing the nucleic acid molecules having the nucleic acid sequence.

[0024] In some embodiments, at least a subset of the nucleic acid molecules are grouped together. In some embodiments, the method further comprises sequencing the nucleic acid molecules to determine the nucleic acid sequence, thereby deriving computer data. In some embodiments, (b) is performed within a time period of less than about 1 day. In some embodiments, (b) is performed with an accuracy of at least about 90%.

[0025] In another aspect, the disclosure provides a method for nucleic acid-based computer data storage, the method including: (a) receiving computer data; (b) synthesizing a nucleic acid molecule comprising at least one nucleic acid sequence encoding the computer data, wherein synthesizing the nucleic acid molecule is in the absence of base-by-base nucleic acid synthesis; and (c) storing the nucleic acid molecule comprising the at least one nucleic acid sequence.

[0026] In some embodiments, the method further includes sequencing the nucleic acid molecule to determine the nucleic acid sequence, thereby deriving computer data. In some embodiments, (b) is performed within a time period of less than about 1 day. In some embodiments, (b) is performed with an accuracy of at least about 90%.

[0027] In another aspect, the disclosure provides a system for encoding binary sequence data using nucleic acids, the system including: a device configured to construct an identifier library, the identifier library comprising a plurality of identifiers, each identifier of the plurality of identifiers comprising one or more components, each individual component of the one or more components being a nucleic acid sequence; and one or more computer processors operably coupled to the device, the one or more computer processors individually or collectively programmed to: (i) translate information into a string of symbols; (ii) map the string of symbols to a plurality of identifiers, each individual identifier of the plurality of identifiers corresponding to an individual symbol in the string of symbols; and (iii) construct the identifier library comprising the plurality of identifiers.

[0028] In some embodiments, the device includes multiple partitions, and the identifier library is generated in one or more of the multiple partitions. In some embodiments, the multiple partitions include wells. In some embodiments, constructing individual identifiers in the identifier library includes assembling one or more components from one or more layers, each layer of the one or more layers including a distinct set of components. In some embodiments, each layer of the one or more layers is stored in a separate portion of the device, and the device is configured to combine one or more components from the one or more layers. In some embodiments, the identifier library includes multiple nucleic acid sequences. In some embodiments, one or more identifier libraries are combined in a single area of ​​the device, and each identifier library of the one or more identifier libraries includes a distinct barcode.

[0029] In another aspect, the disclosure provides a system for reading information encoded in a nucleic acid sequence, the system including: a database storing an identifier library including a plurality of identifiers, each identifier of the plurality of identifiers including one or more components, each individual component of the one or more components including a nucleic acid sequence; and one or more computer processors operably coupled to the database, the one or more computer processors individually or collectively programmed to: (i) identify the plurality of identifiers in the identifier library; (ii) generate a plurality of symbols from the plurality of identifiers identified in (i), each individual symbol of the plurality of symbols corresponding to an individual identifier of the plurality of identifiers; and (iii) compile information from the plurality of symbols.

[0030] In some embodiments, the system further includes a plurality of partitions. In some embodiments, the partitions are wells. In some embodiments, a given partition of the plurality of partitions includes one or more identifier libraries, each identifier library of the one or more identifier libraries including a distinct barcode. In some embodiments, the system further includes a detection unit configured to identify the plurality of identifiers in the identifier library.

[0031] Additional aspects and advantages of the present disclosure will become readily apparent to those skilled in the art from the following detailed description. Only exemplary embodiments of the present disclosure are shown and described. As will be realized, the present disclosure is capable of other and different embodiments, and its several details are capable of modifications in various obvious respects, all without departing from the present disclosure. Accordingly, the drawings and description are to be regarded as illustrative in nature, and not as restrictive. The present specification also provides, for example, the following items: (Item 1) 1. A method for writing information into a nucleic acid sequence, comprising: (a) translating said information into a string of symbols; (b) mapping the string of symbols to a plurality of identifiers, each identifier of the plurality of identifiers comprising one or more components, each component of the one or more components comprising a nucleic acid sequence, each identifier of the plurality of identifiers corresponding to an individual symbol of the string of symbols; and (c) constructing an identifier library including at least a subset of said plurality of identifiers; A method comprising: (Item 2) Item 10. The method of item 1, wherein each symbol in the string of symbols is one of one or more possible symbol values. (Item 3) Item 10. The method of item 1, wherein each symbol in the string of symbols is one of two possible symbol values. (Item 4) Item 10. The method of item 1, wherein one symbol value at each position in the string of symbols can be represented by the absence of a distinct identifier in the identifier library. (Item 5) 4. The method of claim 3, wherein the two possible symbol values ​​are bit values ​​of 0 and 1, and wherein the individual symbols in the string of symbols having the bit value of 0 can be represented by the absence of a distinct identifier in the identifier library, and the individual symbols in the string of symbols having the bit value of 1 can be represented by the presence of the distinct identifier in the identifier library, and vice versa. (Item 6) 2. The method of claim 1, wherein constructing the individual identifiers in the identifier library comprises assembling the one or more components from one or more layers, each layer of the one or more layers comprising a distinct set of components. (Item 7) 7. The method of claim 6, wherein the individual identifiers from the identifier library include one component from each layer of the one or more layers. (Item 8) Item 9. The method of item 7, wherein the one or more components are assembled in a fixed order. Item 8. The method of item 7, wherein the one or more components are assembled in any order. (Item 10) 8. The method of claim 7, wherein the one or more components are assembled with one or more partition components placed between two components from different layers of the one or more layers. (Item 11) 7. The method of claim 6, wherein the individual identifiers include one component from each layer of the subset of one or more layers. (Item 12) 7. The method of claim 6, wherein the individual identifiers include at least one component from each of the one or more layers. (Item 13) 7. The method of claim 6, wherein the one or more components are assembled using overlap extension polymerase chain reaction (PCR), polymerase cycling assembly, sticky end ligation, BioBrick assembly, Golden Gate assembly, Gibson assembly, recombinase assembly, ligase cycling reaction, or template-directed ligation. (Item 14) 2. The method of claim 1, wherein constructing the individual identifiers in the identifier library comprises deleting, exchanging, or inserting at least one component in the parent identifier by applying a nucleic acid editing enzyme to the parent identifier. (Item 15) 15. The method of claim 14, wherein the parent identifier comprises nuclease-specific target sites, recombinase recognition sites, or multiple components flanked by separate spacer sequences. (Item 16) Item 15. The method of item 14, wherein the nucleic acid editing enzyme is selected from the group consisting of CRISPR-Cas, TALEN, zinc finger nuclease, recombinase, and functional variants thereof. (Item 17) 2. The method of claim 1, wherein the identifier library comprises a plurality of nucleic acid sequences. (Item 18) 18. The method of claim 17, wherein the plurality of nucleic acid sequences stores metadata of the information and / or hides the information. (Item 19) Item 19. The method of item 18, wherein the metadata includes secondary information corresponding to the source of the information, the intended recipient of the information, the original format of the information, the equipment and methods used to encode the information, the date and time of writing the information to the identifier library, any modifications made to the information, and / or references to other information. (Item 20) Item 10. The method of item 1, wherein one or more identifier libraries are combined and each identifier library of the one or more identifier libraries is tagged with a separate barcode. (Item 21) 21. The method of claim 20, wherein each individual identifier in the identifier library comprises the distinct barcode. (Item 22) Item 10. The method of item 1, wherein the plurality of identifiers are selected to facilitate read, write, access, copy, and delete operations. (Item 23) Item 10. The method of claim 1, wherein the plurality of identifiers are selected to minimize write errors, mutations, degradations, and read errors. (Item 24) 1. A method for copying information encoded in a nucleic acid sequence, comprising: (a) providing an identifier library encoding a string of symbols, the identifier library comprising a plurality of identifiers, each identifier of the plurality of identifiers comprising one or more components, each component of the one or more components comprising a nucleic acid sequence, each identifier of the plurality of identifiers corresponding to an individual symbol of the string of symbols; (b) constructing one or more copies of said identifier library; A method comprising: (Item 25) 25. The method of claim 24, wherein the plurality of identifiers comprises one or more primer binding sites. (Item 26) 26. The method of claim 25, wherein the identifier library is copied using polymerase chain reaction (PCR). (Item 27) 27. The method of item 26, wherein the PCR is conventional PCR or linear PCR, and the number of copies of the identifier library doubles or increases linearly, respectively, with each PCR cycle. (Item 28) 26. The method of claim 25, wherein the individual identifiers in the identifier library are ligated into a circular vector prior to PCR, the circular vector comprising a barcode at each end of the individual identifiers. (Item 29) 25. The method of claim 24, wherein the identifier library comprises a plurality of nucleic acid sequences. (Item 30) 30. The method of item 29, wherein the plurality of nucleic acid sequences are copied. (Item 31) 25. The method of claim 24, wherein one or more identifier libraries are combined prior to copying, and each library of the one or more identifier libraries comprises a distinct barcode. (Item 32) 1. A method for accessing information encoded within a nucleic acid sequence, comprising: (a) providing an identifier library encoding a string of symbols, the identifier library comprising a plurality of identifiers, each identifier of the plurality of identifiers comprising one or more components, each component of the one or more components comprising a nucleic acid sequence, each identifier of the plurality of identifiers corresponding to an individual symbol of the string of symbols; (b) extracting a target subset of the plurality of identifiers from the identifier library; A method comprising: (Item 33) 33. The method of claim 32, wherein a plurality of probes is combined with the identifier library. (Item 34) 34. The method of claim 33, wherein the plurality of probes share complementarity with the one or more members of the individual identifiers of the target subset of the identifier library. (Item 35) 35. The method of claim 34, wherein the plurality of probes hybridize to a portion of the target subset of the plurality of identifiers in the identifier library. (Item 36) 35. The method of claim 34, wherein the plurality of probes comprises one or more affinity tags, and the one or more affinity tags are captured by affinity beads or an affinity column. (Item 37) 34. The method of claim 33, wherein the identifier library is sequentially combined with one or more subsets of the plurality of probes, and a portion of the target subset of the identifier library binds to the one or more subsets of the plurality of probes. (Item 38) 38. The method of claim 37, wherein the portion of the identifier library that binds to the one or more subsets of the plurality of probes is removed prior to adding another subset of the plurality of probes to the identifier library. (Item 39) 33. The method of claim 32, wherein the individual identifiers of the plurality of identifiers comprise one or more common primer binding regions, one or more variable primer binding regions, or any combination thereof. (Item 40) 40. The method of claim 39, wherein the identifier library is combined with primers that bind to the one or more common primer binding regions or to the one or more variable primer binding regions. (Item 41) 41. The method of claim 40, wherein the primers that bind to the one or more variable primer binding regions are used to selectively amplify the target subset of the identifier library. (Item 42) 33. The method of claim 32, wherein a portion of the identifiers is removed from the identifier library by selective nuclease cleavage. (Item 43) 43. The method of claim 42, wherein the identifier library is combined with Cas9 and a guide probe, and the guide probe guides the Cas9 to remove specified identifiers from the identifier library. (Item 44) 43. The method of claim 42, wherein the individual identifiers are single-stranded and the identifier library is combined with a single-strand-specific endonuclease. (Item 45) 45. The method of claim 44, wherein the identifier library is mixed with a complementary set of individual identifiers that protect target individual identifiers from degradation prior to addition of the single-strand-specific endonuclease. (Item 46) Item 43. The method of item 42, wherein the individual identifiers that are not cleaved by the selective nuclease cleavage are separated by size-selective chromatography. (Item 47) 43. The method of claim 42, wherein the individual identifiers that are not cleaved by the selective nuclease cleavage are amplified, and the individual identifiers that are cleaved by the selective nuclease cleavage are not amplified. (Item 48) 33. The method of claim 32, wherein the identifier library comprises a plurality of nucleic acid sequences, and the plurality of nucleic acid sequences is extracted at the target subset of the plurality of identifiers in the identifier library. (Item 49) 1. A method for reading information encoded in a nucleic acid sequence, comprising: (a) providing an identifier library comprising a plurality of identifiers, wherein each identifier of the plurality of identifiers comprises one or more components, and each component of the one or more components comprises a nucleic acid sequence; (b) identifying the plurality of identifiers within the identifier library; and (c) generating a plurality of symbols from the plurality of identifiers identified in (b), each symbol of the plurality of symbols corresponding to a respective identifier of the plurality of identifiers; (d) compiling said information from said plurality of symbols; A method comprising: (Item 50) Item 49. The method of item 49, wherein the presence of an individual identifier in the identifier library corresponds to a first symbol value in a binary string, and the absence of the individual identifier from the identifier library corresponds to a second symbol value in the binary string. (Item 51) Item 51. The method of item 50, wherein the first symbol value is a bit value of 1 and the second symbol value is a bit value of 0. (Item 52) Item 51. The method of item 50, wherein the first symbol value is a bit value of 0 and the second symbol value is a bit value of 1. (Item 53) 50. The method of claim 49, wherein identifying the plurality of identifiers comprises sequencing the plurality of identifiers. (Item 54) 54. The method of claim 53, wherein sequencing comprises digital polymerase chain reaction (PCR), quantitative PCR, microarray, sequencing-by-synthesis, or massively parallel sequencing. (Item 55) 50. The method of claim 49, wherein the identifier library comprises a plurality of nucleic acid sequences. (Item 56) 56. The method of claim 55, wherein the plurality of nucleic acid sequences stores metadata of the information and / or hides the information. (Item 57) 50. The method of claim 49, wherein one or more identifier libraries are combined, and each identifier library in the one or more identifier libraries comprises a distinct barcode. (Item 58) Item 58. The method of item 57, wherein the barcode stores metadata about the information. (Item 59) 1. A system for encoding binary sequence data using nucleic acids, comprising: a device configured to construct an identifier library, the identifier library comprising a plurality of identifiers, each identifier of the plurality of identifiers comprising one or more components, each component of the one or more components being a nucleic acid sequence; one or more computer processors operably coupled to the device, the one or more computer processors individually or collectively programmed to: (i) translate the information into a string of symbols; (ii) map the string of symbols to the plurality of identifiers, wherein each identifier of the plurality of identifiers corresponds to a respective symbol of the string of symbols; and (iii) build an identifier library including the plurality of identifiers; A system including: (Item 60) 60. The method of claim 59, wherein the device includes a plurality of partitions and the identifier library is generated in one or more of the plurality of partitions. (Item 61) 60. The method of claim 59, wherein the plurality of partitions comprises wells. (Item 62) 60. The method of claim 59, wherein constructing the individual identifiers in the identifier library comprises assembling the one or more components from one or more layers, each layer of the one or more layers comprising a separate set of components. (Item 63) Item 63. The method of item 62, wherein each layer of the one or more layers is stored in a separate portion of the device, and the device is configured to combine the one or more components from the one or more layers. (Item 64) 60. The method of claim 59, wherein the identifier library comprises a plurality of nucleic acid sequences. (Item 65) Item 60. The method of item 59, wherein one or more identifier libraries are combined in a single area of ​​the device, and each identifier library of the one or more identifier libraries comprises a separate barcode. (Item 66) 1. A system for reading information encoded in a nucleic acid sequence, comprising: a database storing an identifier library comprising a plurality of identifiers, each identifier of the plurality of identifiers comprising one or more components, each component of the one or more components comprising a nucleic acid sequence; one or more computer processors operably coupled to the database, the one or more computer processors individually or collectively programmed to: (i) identify the plurality of identifiers in the identifier library; (ii) generate a plurality of symbols from the plurality of identifiers identified in (i), each individual symbol of the plurality of symbols corresponding to an individual identifier of the plurality of identifiers; and (iii) compile the information from the plurality of symbols; A system including: (Item 67) Item 67. The method of item 66, further comprising a device including multiple partitions. (Item 68) Item 68. The method of item 67, wherein the partition is a well. (Item 69) Item 67. The method of item 66, wherein a given partition of the plurality of partitions includes one or more identifier libraries, each identifier library of the one or more identifier libraries including a distinct barcode. (Item 70) Item 67. The method of item 66, wherein the system further comprises a detection unit configured to identify the plurality of identifiers in the identifier library.

[0032] Incorporation by Reference All publications, patents, and patent applications discussed herein are incorporated by reference to the same extent as if each individual publication, patent, or patent application was specifically and individually indicated to be incorporated by reference. To the extent that the publications and patents or patent applications incorporated by reference conflict with the disclosure contained herein, the present specification is intended to supersede and / or supersede any such conflicting material.

[0033] The novel features of the invention are set forth with particularity in the appended claims. A better understanding of the features and advantages of the present invention will be obtained by reference to the following detailed description that sets forth illustrative embodiments, in which the principles of the invention are utilized, and the accompanying drawings (also referred to herein as "Figure" and "FIG."). [Brief explanation of the drawings]

[0034] [Figure 1] FIG. 1 is a diagram illustrating a general overview of the process for encoding, writing, accessing, reading, and decoding digital information stored within nucleic acid sequences.

[0035] [Figure 2] Figures 2A and 2B are diagrams that generally illustrate an exemplary method for encoding digital data, referred to as "data at an address," using objects or identifiers (e.g., nucleic acid molecules). Figure 2A illustrates combining a rank object (or address object) with a byte value object (or data object) to create an identifier. Figure 2B illustrates one embodiment of a data at an address method in which the rank object and byte value object are themselves combinatorial concatenations of other objects.

[0036] [Figure 3]Figures 3A and 3B are diagrams that generally illustrate exemplary methods for encoding digital information using objects or identifiers (e.g., nucleic acid sequences). Figure 3A illustrates encoding digital information using a rank object as an identifier. Figure 3B illustrates one embodiment of a method for encoding in which an address object is itself a combinatorial concatenation of other objects.

[0037] [Figure 4] FIG. 4 illustrates a contour plot in logarithmic space of the relationship between the combinatorial space of possible identifiers (C, x-axis) and the average number of identifiers (k, y-axis) that can be constructed to store a given size of information (contour).

[0038] [Figure 5] FIG. 5 is a diagram illustrating a schematic overview of a method for writing information into a nucleic acid sequence (eg, deoxyribonucleic acid).

[0039] [Figure 6] Figures 6A and 6B illustrate an exemplary method, called a "product scheme," for constructing an identifier (e.g., a nucleic acid molecule) by combinatorially assembling separate components (e.g., nucleic acid sequences). Figure 6A illustrates the architecture of an identifier constructed using the product scheme. Figure 6B illustrates an example of a combinatorial space of identifiers that can be constructed using the product scheme.

[0040] [Figure 7] FIG. 7 is a diagram illustrating generally the use of overlap extension polymerase chain reaction to construct identifiers (eg, nucleic acid molecules) from building blocks (eg, nucleic acid sequences).

[0041] [Figure 8] FIG. 8 is a diagram illustrating generally the use of sticky end ligation to construct identifiers (eg, nucleic acid molecules) from building blocks (eg, nucleic acid sequences).

[0042] [Figure 9] FIG. 9 is a diagram illustrating generally the use of recombinase assembly to construct identifiers (eg, nucleic acid molecules) from building blocks (eg, nucleic acid sequences).

[0043] [Figure 10A] 10A and 10B are diagrams illustrating template-directed ligation. Figure 10A is a diagram that schematically illustrates the use of template-directed ligation to construct identifiers (e.g., nucleic acid molecules) from building blocks (e.g., nucleic acid sequences). [Figure 10B] Figures 10A and 10B are diagrams illustrating template-directed ligation: Figure 10B shows a histogram of copy numbers (abundances) of 256 distinct nucleic acid sequences, each assembled combinatorially from six nucleic acid sequences (e.g., building blocks) in one pooled template-directed ligation reaction.

[0044] [Figure 11A] 11A and 11G are diagrams that schematically illustrate an exemplary method, referred to as the "sorting scheme," for constructing identifiers (e.g., nucleic acid molecules) with sorted components (e.g., nucleic acid sequences). FIG. 11A illustrates the architecture of an identifier constructed using the sorting scheme. [Figure 11B] Figures 11A and 11G are diagrams that schematically illustrate an exemplary method, referred to as a "sorting scheme," for constructing identifiers (e.g., nucleic acid molecules) with sorted components (e.g., nucleic acid sequences). Figure 11B is a diagram that illustrates an example of a combinatorial space of identifiers that can be constructed using the sorting scheme. [Figure 11C]11A and 11G are diagrams that schematically illustrate an exemplary method, referred to as the "sorting scheme," for constructing identifiers (e.g., nucleic acid molecules) with sorted components (e.g., nucleic acid sequences). FIG. 11C is a diagram that illustrates an exemplary implementation of the sorting scheme with template-directed ligation. [Figure 11D] Figures 11A and 11G are diagrams that schematically illustrate an exemplary method, referred to as a "permutation scheme," for constructing an identifier (e.g., a nucleic acid molecule) with permuted components (e.g., a nucleic acid sequence). Figure 11D is a diagram that illustrates an example of how the implementation from Figure 11C can be modified to construct an identifier with permuted repeated components. [Figure 11E] 11A and 11G are diagrams that schematically illustrate an exemplary method, referred to as a "sorting scheme," for constructing identifiers (e.g., nucleic acid molecules) with sorted components (e.g., nucleic acid sequences). FIG. 11E is a diagram that illustrates how the exemplary implementation from FIG. 11D can lead to undesired by-products that can be removed along with nucleic acid size selection. [Figure 11F] 11A and 11G are diagrams that schematically illustrate an exemplary method, referred to as the "sorting scheme," for constructing identifiers (e.g., nucleic acid molecules) with permuted components (e.g., nucleic acid sequences). FIG. 11F is a diagram that illustrates another example of how template-directed ligation and size selection should be used to construct identifiers with permuted repeated components. [Figure 11G] 11A and 11G are diagrams that schematically illustrate an exemplary method, referred to as a "sorting scheme," for constructing identifiers (e.g., nucleic acid molecules) with sorted components (e.g., nucleic acid sequences). FIG. 11G illustrates an example of when size selection may fail to isolate a particular identifier from unwanted by-products.

[0045] [Figure 12A]12A-12D are diagrams illustrating generally an exemplary method, referred to as the "MchooseK" scheme, for constructing an identifier (e.g., a nucleic acid molecule) having any number K of assembled components (e.g., nucleic acid sequences) from a larger number M of possible components. Figure 12A illustrates the architecture of an identifier constructed using the MchooseK scheme. [Figure 12B] 12A-12D are diagrams illustrating generally an exemplary method, referred to as the "MchooseK" scheme, for constructing identifiers (e.g., nucleic acid molecules) with any number K of assembled components (e.g., nucleic acid sequences) from a larger number M of possible components. FIG. 12B is a diagram illustrating one example of a combinatorial space of identifiers that can be constructed using the MchooseK scheme. [Figure 12C] 12A-12D are diagrams that schematically illustrate an exemplary method, referred to as the "MchooseK" method, for constructing an identifier (e.g., a nucleic acid molecule) with any number K of assembled building blocks (e.g., nucleic acid sequences) from a larger number M of possible building blocks. Figure 12C is a diagram that illustrates one exemplary implementation of the MchooseK method using template-directed ligation. [Figure 12D] 12A-12D are diagrams that schematically illustrate an exemplary method, called the "MchooseK" scheme, for constructing an identifier (e.g., a nucleic acid molecule) with any number K of assembled components (e.g., nucleic acid sequences) from a larger number M of possible components. FIG. 12D is a diagram that illustrates how the exemplary implementation from FIG. 12C can lead to undesired by-products that can be removed along with nucleic acid size selection.

[0046] [Figure 13A] Figures 13A and 13B are diagrams that schematically illustrate an example method, called the "partition scheme," for constructing identifiers with partitioned components. Figure 13A is a diagram that illustrates an example of a combinatorial space of identifiers that can be constructed using the partition scheme. [Figure 13B]13A and 13B are diagrams that schematically illustrate an exemplary method, referred to as the "partition scheme," for constructing an identifier with partitioned components. FIG. 13B depicts an exemplary implementation of the partition scheme using template-directed ligation.

[0047] [Figure 14A] 14A and 14B are diagrams that schematically illustrate an exemplary method, called the "unconstrained string" (or USS) method, for constructing identifiers composed of any string of components from several possible components. Figure 14A is a diagram illustrating an example of a combinatorial space of identifiers that can be constructed using the USS method. [Figure 14B] 14A and 14B are diagrams illustrating an exemplary method, called the "unconstrained string" (or USS) method, for constructing an identifier composed of any string of components from several possible components. FIG. 14B illustrates one exemplary implementation of the USS method using template-directed ligation.

[0048] [Figure 15A] Figures 15A and 15B are diagrams that schematically illustrate an example method, called "component deletion," for constructing identifiers by removing components from a parent identifier. Figure 15A illustrates an example of a combinatorial space of identifiers that can be constructed using the component deletion scheme. [Figure 15B] Figures 15A and 15B are diagrams illustrating schematically an exemplary method, called "component deletion," for constructing an identifier by removing components from a parent identifier. Figure 15B illustrates an exemplary implementation of the component deletion scheme using double-stranded targeted cleavage and repair.

[0049] [Figure 16] FIG. 16 is a diagram illustrating a schematic of a parent identifier with a recombinase recognition site from which further identifiers may be constructed by applying a recombinase to the parent identifier.

[0050] [Figure 17A] 17A-17C are diagrams illustrating an example method for accessing a portion of information stored in a nucleic acid sequence by accessing a few specific identifiers from a larger number of identifiers. Figure 17A illustrates an example method for accessing identifiers containing specified components using polymerase chain reaction, affinity tag probes, and degraded target probes. [Figure 17B] Figures 17A-17C are diagrams illustrating an example method for accessing a portion of information stored within a nucleic acid sequence by accessing a number of specific identifiers from a larger number of identifiers. Figure 17B is a diagram illustrating an example method for using the polymerase chain reaction to perform an "OR" or "AND" operation to access identifiers containing multiple specified components. [Figure 17C] 17A-17C are diagrams illustrating an example method for accessing a portion of information stored in a nucleic acid sequence by accessing a number of specific identifiers from a larger number of identifiers. FIG. 17C illustrates an example method for using affinity tags to perform an "OR" or "AND" operation to access identifiers containing multiple specified components.

[0051] [Figure 18] Figures 18A and 18B are diagrams illustrating an example of encoding, writing, and reading data encoded in a nucleic acid molecule. Figure 18A illustrates an example of encoding, writing, and reading 5,856 bits of data. Figure 18b illustrates an example of encoding, writing, and reading 62,824 bits of data.

[0052] [Figure 19]FIG. 19 is a diagram illustrating a computer system programmed or otherwise configured to implement the methods provided herein. DETAILED DESCRIPTION OF THE INVENTION

[0053] Detailed Description While various embodiments of the present invention have been shown and described herein, it will be apparent to those skilled in the art that such embodiments are provided by way of example only. Numerous variations, changes, and substitutions will occur to those skilled in the art without departing from the invention. It should be understood that various alternatives to the embodiments of the invention described herein may be employed.

[0054] As used herein, the term "symbol" generally refers to a representation of a unit of digital information. Digital information may be divided or translated into a string of symbols. In one example, a symbol may be a bit, and a bit may have a value of "0" or "1."

[0055] As used herein, the terms "distinct" or "unique" generally refer to an object that is distinguishable from other objects in a group. For example, a distinct or unique nucleic acid sequence may be a nucleic acid sequence that does not have the same sequence as any other nucleic acid sequence. A distinct or unique nucleic acid molecule may also not have the same sequence as any other nucleic acid molecule. A distinct or unique nucleic acid sequence or molecule may share regions of similarity with another nucleic acid sequence or molecule.

[0056] The term "component" as used herein generally refers to a nucleic acid sequence. A component may be a separate nucleic acid sequence. A component may be linked or assembled with one or more other components to produce another nucleic acid sequence or molecule.

[0057] As used herein, the term "stratum" generally refers to a group or pool of components. Each stratum may contain a distinct set of components such that the components in one stratum differ from the components in another stratum. Components from one or more stratums may be assembled to generate one or more identifiers.

[0058] As used herein, the term "identifier" generally refers to a nucleic acid molecule or sequence that represents the position and value of a bit string within a larger bit string. More generally, an identifier may refer to any object that represents or corresponds to a symbol within a string of symbols. In some embodiments, an identifier may include one or more concatenated components.

[0059] As used herein, the term "combinatorial space" generally refers to the set of all possible distinct identifiers that can be generated from a starting set of objects, such as components, and an allowable set of rules on how to modify those objects to form identifiers. The size of the combinatorial space of identifiers created by assembling or linking components may depend on the number of layers of components, the number of components in each layer, and the particular assembly method used to generate the identifiers.

[0060] As used herein, the term "identifier rank" generally refers to a relationship that defines the ordering of identifiers within a set.

[0061] As used herein, the term "identifier library" generally refers to a collection of identifiers that correspond to symbols in a symbol string representing digital information. In some embodiments, the absence of a given identifier in an identifier library may indicate a symbol value at a particular position. One or more identifier libraries may be combined in a pool, group, or set of identifiers. Each identifier library may include a unique barcode that identifies the identifier library.

[0062] The term "nucleic acid" as used herein generally refers to deoxyribonucleic acid (DNA), ribonucleic acid (RNA), or variants thereof. Nucleic acids can contain one or more subunits selected from adenosine (A), cytosine (C), guanine (G), thymine (T), and uracil (U), or variants thereof. Nucleotides can include A, C, G, T, or U, or variants thereof. Nucleotides can include any subunit that can be incorporated into a growing nucleic acid chain. Such subunits can be A, C, G, T, or U, or any other subunit that can be unique to one of the more complementary A, C, G, T, or U, or that can be complementary to a purine (i.e., A or G, or variants thereof) or pyrimidine (i.e., C, T, or U, or variants thereof). In some examples, nucleic acids can be single-stranded or double-stranded, and in some cases, nucleic acids are circular.

[0063] As used herein, the term "nucleic acid molecule" or "nucleic acid sequence" generally refers to a polymeric form of nucleotides, i.e., a polynucleotide, which may be of various lengths, and which is deoxyribonucleotides (DNA) or ribonucleotides (RNA) or their analogs. The term "nucleic acid sequence" may refer to the alphabetic representation of a polynucleotide. Alternatively, the term may apply to the physical polynucleotide itself. This alphabetic representation can be entered into a database within a computer having a central processing unit, which maps the nucleic acid sequence or nucleic acid molecule to symbols or bits and uses them to encode digital information. A nucleic acid sequence or oligonucleotide may contain one or more non-standard nucleotides, nucleotide analogs, and / or modified nucleotides.

[0064] As used herein, "oligonucleotide" generally refers to a single-stranded nucleic acid sequence, typically composed of a unique sequence of four nucleotide bases: adenine (A), cytosine (C), guanine (G), and thymine (T), or uracil (U) when the polynucleotide is RNA.

[0065] Examples of modified nucleotides include, but are not limited to, diaminopurine, 5-fluorouracil, 5-bromouracil, 5-chlorouracil, 5-iodouracil, hypoxanthine, xantine, 4-acetylcytosine, 5-(carboxyhydroxymethyl)uracil, 5-carboxymethylaminomethyl-2-thiouridine, 5-carboxymethylaminomethyluracil, dihydrouracil, beta-D-galactosylqueosine, inosine, N6-isopentenyladenine, 1-methylguanine, 1-methylinosine, 2,2-dimethylguanine, 2-methyladenine, 2-methylguanine, 3-methylcytosine, 5-methylcytosine, N6-adenine, 7-methylguanine, 5-methylaminomethyluracil, These include uracil, 5-methoxyaminomethyl-2-thiouracil, beta-D-mannosylqueosine, 5'-methoxycarboxymethyluracil, 5-methoxyuracil, 2-methylthio-D46-isopentenyladenine, uracil-5-oxyacetic acid(v), wybutoxosine, pseudouracil, queosine, 2-thiocytosine, 5-methyl-2-thiouracil, 2-thiouracil, 4-thiouracil, 5-methyluracil, uracil-5-oxyacetic acid methyl ester, uracil-5-oxyacetic acid(v), 5-methyl-2-thiouracil, 3-(3-amino-3-N-2-carboxypropyl)uracil, (acp3)w, 2,6-diaminopurine, and the like. Nucleic acid molecules may also be modified in the base moiety (e.g., at one or more atoms that are typically available to form hydrogen bonds with a complementary nucleotide and / or at one or more atoms that are typically not capable of forming hydrogen bonds with a complementary nucleotide), in the sugar moiety, or in the phosphate backbone.Nucleic acid molecules may also contain amine-modifying groups, such as aminoallyl-dUTP (aa-dUTP) and aminohexhylacrylamide-dCTP (aha-dCTP), to allow for the covalent attachment of amine-reactive moieties, such as N-hydroxysuccinimide ester (NHS).

[0066] As used herein, the term "primer" generally refers to a strand of nucleic acid that can serve as an initiation point for nucleic acid synthesis, such as in a polymerase chain reaction (PCR). In one example, during replication of a DNA sample, an enzyme that catalyzes replication initiates replication at the 3'-end of a primer attached to the DNA sample and copies the opposite strand.

[0067] As used herein, the term "polymerase" or "polymerase enzyme" generally refers to any enzyme capable of catalyzing a polymerase reaction. Examples of polymerases include, without limitation, nucleic acid polymerases. Polymerases can be naturally occurring or synthetic. An exemplary polymerase is Φ29 polymerase or a derivative thereof. In some cases, transcriptases or ligases are used in conjunction with or as a substitute for polymerases (i.e., enzymes that catalyze bond formation) to construct new nucleic acid sequences. Examples of polymerases include DNA polymerase, RNA polymerase, thermostable polymerase, wild-type polymerase, modified polymerase, E. coli DNA polymerase I, T7 DNA polymerase, bacteriophage T4 DNA polymerase, Φ29 (phi29) DNA polymerase, Taq polymerase, Tth polymerase, Tli polymerase, Pfu polymerase, Pwo polymerase, VENT polymerase, DEEPVENT polymerase, Ex-Taq polymerase, LA-Taw polymerase, Sso polymerase, Poc polymerase, and Pab polymerase. polymerase, Mth polymerase ES4 polymerase, Tru polymerase, Tac polymerase, Tne polymerase, Tma polymerase, Tca polymerase, Tih polymerase, Tfi polymerase, Platinum Taq polymerase, Tbr polymerase, Tfl polymerase, Pfutubo polymerase, Pyrobest polymerase, KOD polymerase, Bst polymerase, Sac polymerase, Klenow fragment polymerase with 3' to 5' exonuclease activity, and mutants, modified products, and derivatives thereof.

[0068] Digital information, such as computer data in the form of binary code, can include an array or string of symbols. Binary code, for example, may encode or represent text or computer processor instructions using a binary number system with two binary symbols, typically 0 and 1, called bits. Digital information may be represented in the form of non-binary code, which may include an array of non-binary symbols. Each encoded symbol can be reassigned to a unique bit string (i.e., a "byte"), and the unique bit string or byte can be arranged into a string of bytes or a byte stream. The bit value for a given bit can be one of two symbols (e.g., 0 or 1). A byte can contain a string of N bits, for a total of 2 N For example, a byte containing eight bits can have a total of 2 8 That is, 256 possible unique byte values ​​can be produced, and each of the 256 bytes can correspond to one of 256 possible distinct symbols, characters, or instructions that can be encoded using the bytes. Raw data (e.g., text files and computer instructions) can be represented as a string of bytes, or a byte stream. Zip files or compressed data files containing raw data can be stored in a byte stream; these files can be stored as a byte stream in compressed form and then decompressed back into raw data before being read by a computer.

[0069] The disclosed methods and systems may be used to encode computer data or information in multiple identifiers, each of which may represent one or more bits of the original information. In some examples, the disclosed methods and systems encode data or information using identifiers that each represent two bits of the original information.

[0070] Previous methods for encoding digital information into nucleic acids rely on the base-by-base synthesis of nucleic acids, which can be costly and time-consuming. Alternative methods may improve the efficiency and commercial viability of digital information storage by reducing the reliance on base-by-base nucleic acid synthesis to encode digital information, eliminating the need for de novo synthesis of separate nucleic acid sequences for every new information storage requirement.

[0071] Instead of relying on base-by-base or de novo nucleic acid synthesis (e.g., phosphoramidite synthesis), the new methods can encode digital information (e.g., binary code) or nucleic acid sequences in multiple identifiers, involving combinatorial arrangements of building blocks. Thus, the new strategies can generate a first set of distinct nucleic acid sequences (or building blocks) for a first information storage request, and then reuse the same nucleic acid sequences (or building blocks) for subsequent information storage requests. These approaches can significantly reduce the cost of DNA-based information storage by reducing the role of de novo synthesis of nucleic acid sequences in the information-DNA encoding and writing process. Furthermore, unlike implementations of base-by-base synthesis, such as phosphoramidite-free or template-free polymerase-based nucleic acid extension, which may use cyclic delivery of each base to each extending nucleic acid, the new methods of information-DNA writing using identifier structures from building blocks are highly parallelizable processes that do not necessarily use cyclic nucleic acid extension. Thus, the new methods can increase the speed at which digital information can be written to DNA compared to older methods.

[0072] Methods for encoding and writing information into nucleic acid sequences In one aspect, the present disclosure provides a method for encoding information into a nucleic acid sequence. The method for encoding information into a nucleic acid sequence may include (a) translating the information into a string of symbols, (b) mapping the string of symbols to a plurality of identifiers, and (c) constructing an identifier library including at least a subset of the plurality of identifiers. Each identifier of the plurality of identifiers may include one or more components. Each component of the one or more components may include a nucleic acid sequence. Each symbol at each position in the string of symbols may correspond to a separate identifier. An individual identifier may correspond to an individual symbol at each position in the string of symbols. Furthermore, one symbol at each position in the string of symbols may correspond to the absence of an identifier. For example, in a string of binary symbols (e.g., bits) of "0" and "1," each occurrence of "0" may correspond to the absence of an identifier.

[0073] In another aspect, the present disclosure provides a method for nucleic acid-based computer data storage. The method for nucleic acid-based computer data storage may include (a) receiving computer data, (b) synthesizing nucleic acid molecules including a nucleic acid sequence that encodes the computer data, and (c) storing the nucleic acid molecules having the nucleic acid sequence. The computer data may be synthesized and encoded within at least a subset of the nucleic acid molecules that are not within the sequence of each of the nucleic acid molecules.

[0074] In another aspect, the present disclosure provides a method for writing and storing information into a nucleic acid sequence. The method may include (a) receiving or encoding a virtual identifier library representing the information, (b) physically constructing the identifier library, and (c) storing one or more physical copies of the identifier library in one or more separate locations. An individual identifier in the identifier library may include one or more components. An individual component of the one or more components may include a nucleic acid sequence.

[0075] In another aspect, the present disclosure provides a method for nucleic acid-based computer data storage. The method for nucleic acid-based computer data storage may include (a) receiving computer data, (b) synthesizing a nucleic acid molecule comprising at least one nucleic acid sequence encoding the computer data, and (c) storing the nucleic acid molecule comprising at least one nucleic acid sequence. Synthesizing the nucleic acid molecule may be in the absence of base-by-base nucleic acid synthesis.

[0076] In another aspect, the present disclosure provides a method for writing and storing information into a nucleic acid sequence. The method for writing and storing information into a nucleic acid sequence may include (a) receiving or encoding a virtual identifier library representing the information, (b) physically constructing the identifier library, and (c) storing one or more physical copies of the identifier library in one or more separate locations. An individual identifier in the identifier library may include one or more components. An individual component of the one or more components may include a nucleic acid sequence.

[0077] FIG. 1 illustrates an overview process for encoding information into a nucleic acid sequence, writing information into a nucleic acid sequence, reading information written into a nucleic acid sequence, and decoding the read information. Digital information, or data, may be translated into one or more strings of symbols. In one example, the symbols are bits, and each bit may have a value of either "0" or "1." Each symbol may be mapped to or encoded into an object (e.g., an identifier) ​​that represents that symbol. Each symbol may be represented by a distinct identifier. The distinct identifier may be a nucleic acid molecule composed of components. The components may be nucleic acid sequences. Digital information may be written into a nucleic acid sequence by generating an identifier library corresponding to the information. The identifier library may be physically created by physically constructing an identifier corresponding to each symbol of the digital information. All or any portion of the digital information may be accessed at one time. In one example, a subset of the identifiers is accessed from the identifier library. The subset of identifiers may be read by sequencing and identifying the identifiers. The identified identifiers may be associated with corresponding symbols to decode the digital data.

[0078] A method for encoding and reading information using the technique of FIG. 1 can include, for example, receiving a bitstream and mapping each individual bit (a bit having a bit value of "1") within the bitstream to a separate nucleic acid identifier using an identifier rank or nucleic acid index. Constructing a nucleic acid sample pool or identifier library can include a copy of the identifier corresponding to the bit value of 1 (and excluding the identifier for the bit value of 0). Reading the sample can include using molecular biology methods (such as sequencing, hybridization, PCR, etc.), determining which identifiers are represented within the identifier library, assigning a bit value of "1" to the bits corresponding to those identifiers and a bit value of "0" elsewhere (referring again to the identifier rank to identify the bits within the original bitstream corresponding to each identifier), and thus decoding the information back to the original encoded bitstream.

[0079] Encoding a string of N distinct bits allows for an equal number of unique nucleic acid sequences to be used as possible identifiers. This approach to information encoding may use de novo synthesis of an identifier (e.g., a nucleic acid molecule) for each new item of information (a string of N bits) to be stored. In other cases, the cost of synthesizing a new identifier (equal to or less than N in number) for each new item of information to be stored may be reduced by a one-time de novo synthesis and subsequent maintenance of all possible identifiers; thus, encoding a new item of information may involve mechanically selecting and mixing together pre-synthesized (or pre-fabricated) identifiers to form an identifier library. In other cases, the cost of both (1) synthesizing up to N identifiers de novo for each new item of information to be stored or (2) maintaining and selecting from N possible identifiers for each new item of information to be stored, or a combination thereof, may be reduced by synthesizing and maintaining a number (smaller than N, and in some cases much smaller than N) of nucleic acid sequences and then modifying these sequences through enzymatic reactions to generate up to N identifiers for each new item of information to be stored.

[0080] Identifiers may be rationally designed and selected to facilitate read, write, access, copy, and delete operations. Identifiers may be designed and selected to minimize write errors, mutations, degradation, and read errors.

[0081] 2A and 2B schematically illustrate an exemplary method, called "data at addresses," for encoding digital data within an object or identifier (e.g., a nucleic acid molecule). FIG. 2A illustrates encoding a bit stream into an identifier library, where each identifier is constructed by concatenating or assembling a single component that specifies an identifier rank with a single component that specifies a byte value. Generally, data at addresses methods use identifiers that modularly encode information by including two objects: one object, a "byte value object" (or "data object"), that identifies a byte value, and one object, a "rank object" (or "address object"), that identifies the identifier rank (or relative position of the byte within the original bit stream). FIG. 2B illustrates an example of a data at addresses method in which each rank object may be combinatorially constructed from a set of components, and each byte value object may be combinatorially constructed from a set of components. Such a combinatorial structure of rank objects and byte value objects allows more information to be written into the identifier than objects made from only a single component (e.g., FIG. 2A).

[0082] 3A and 3B schematically illustrate another exemplary method for encoding digital information in an object or identifier (e.g., a nucleic acid sequence). FIG. 3A illustrates encoding a bit stream into an identifier library, where the identifier is constructed from a single component that specifies an identifier rank. The presence of the identifier at a particular rank (or address) specifies a bit value of "1," and the absence of the identifier at a particular rank (or address) specifies a bit value of "0." This type of encoding may use identifiers that encode only the rank (the relative position of the bit in the original bit stream) and use the presence or absence of those identifiers in the identifier library to encode a bit value of "1" or "0," respectively. Reading and decoding the information may involve identifying identifiers present in the identifier library and assigning a bit value of "1" to their corresponding rank and a bit value of "0" elsewhere. FIG. 3B illustrates an exemplary encoding method in which each identifier may be combinatorially constructed from a set of components, such that each possible combinatorial structure specifies a rank. Such a combinatorial structure allows more information to be written into an identifier than an identifier made from only a single component (e.g., FIG. 3A). For example, a component set may include five distinct components. The five distinct components may be assembled to generate ten distinct identifiers, each containing two of the five components. Each of the ten distinct identifiers may have a rank (or address) corresponding to the position of a bit in the bit stream. An identifier library may include a subset of those ten possible identifiers that correspond to the position of a bit value "1" and exclude a subset of those ten possible identifiers that correspond to the position of a bit value "0" in a bit stream of length 10.

[0083] FIG. 4 illustrates a contour plot in logarithmic space of the relationship between the combinatorial space of possible identifiers (C, x-axis) and the average number of identifiers (k, y-axis) that can be physically constructed to store information of a given original size in bits (D, contour) using the encoding method shown in FIGS. 3A and 3B. This plot assumes that the original information of size D is recoded into a string of C bits (where C may be greater than D) if some bits k have a bit value of "1." The plot further assumes that information-nucleic acid encoding is performed on the recoded bit string, constructing identifiers for positions where the bit value is "1" and not constructing identifiers for positions where the bit value is "0." According to the assumption, the combinatorial space of possible identifiers has size C to identify every position in the recoded bit string, and the number of identifiers used to encode a bit string of size D is such that D = log(Cchoosek), where Cchoosek may be a mathematical expression for the number of means to pick k random outcomes from C possibilities. Thus, as the combinatorial space of possible identifiers increases beyond the size (in bits) of a given item of information, the number of physically constructed identifiers used to store the given information may decrease.

[0084] Figure 5 illustrates a general method for writing information to a nucleic acid sequence. Before writing the information, the information may be translated into a string of symbols and encoded into multiple identifiers. Writing the information may include setting up a reaction to produce a possible identifier. A reaction may be set up by placing inputs into compartments. The inputs may include nucleic acids, building blocks, templates, enzymes, or chemical reagents. A compartment may be a well, a tube, a location on a surface, a chamber in a microfluidic device, or a droplet in an emulsion. Multiple reactions may be set up in multiple compartments. Reactions may proceed to produce identifiers through programmed temperature incubation or cycling. Reactions may be selectively or ubiquitously removed (e.g., deleted). Reactions may be selectively or ubiquitously interrupted, merged, and refined to collect identifiers into a single pool. Identifiers from multiple identifier libraries may be collected into the same pool. Individual identifiers may include barcodes or tags to identify which identifier library they belong to. Alternatively, or in addition, the barcode may contain metadata for the encoded information. Supplemental nucleic acids or identifiers may be included in the identifier pool along with the identifier library. The supplemental nucleic acids or identifiers may contain metadata for the encoded information or serve to obscure or conceal the encoded information.

[0085] The identifier rank (e.g., nucleic acid index) may include a method or key for determining the ordering of the identifiers. The method may include a lookup table with all identifiers and their corresponding ranks. The method may also include a lookup table with the ranks of all components that make up the identifier and a function for determining the ordering of any identifier that includes a combination of those components. Such a method may be called lexicographic ordering and may be similar to the way words in a dictionary are ordered alphabetically. In a data encoding method in an address, the identifier rank (encoded by the identifier's rank object) may be used to determine the position of a byte in the bitstream (encoded by the identifier's byte value object). In an alternative method, the identifier rank for the current identifier (encoded by the entire identifier itself) may be used to determine the position of a "1" bit value in the bitstream.

[0086] The key may assign separate bytes to unique subsets of identifiers (e.g., nucleic acid molecules) within the sample. For example, in a simple form, the key may assign each bit within the byte to a unique nucleic acid sequence that specifies the bit's position, and the presence or absence of that nucleic acid sequence within the sample may then specify a bit value of 1 or 0, respectively. Reading the encoded information from the nucleic acid samples can include any number of molecular biology techniques, including sequencing, hybridization, or PCR. In some embodiments, reading the encoded dataset can include reconstructing a portion of the dataset or reconstructing the entire encoded dataset from each nucleic acid sample. When the sequences can be read, a nucleic acid index is available along with the presence or absence of unique nucleic acid sequences, and the nucleic acid sample can be decoded into a bitstream (e.g., individual strings of bits, bytes, multiple bytes, or strings of bytes).

[0087] Identifiers may be constructed by combinatorially assembling component nucleic acid sequences. For example, information may be encoded by deriving a set of nucleic acid molecules (e.g., identifiers) from a defined group of molecules (e.g., combinatorial space). Each possible identifier in a defined group of molecules may be an assembly of nucleic acid sequences (e.g., components) from a prefabricated set of components, which may be divided into layers. Each individual identifier may be constructed by linking one component from every layer in a fixed order. For example, if there are M layers, and each layer may have n components, then the maximum C=n M unique identifiers may be constructed, with a maximum of 2 C Different items or C bits of information may be encoded and stored. For example, the storage of a megabit of information may take 1×10 6 distinct identifiers or size C = 1 × 10 6 The identifier in this example may be assembled from various components organized in different ways. The assemblies may each have n=1×10 3 Alternatively, the assembly may be made from M=2 pre-fabricated layers, each containing n=1×10 2 A digital image may be made from M=3 layers containing M components. As this example illustrates, using a larger number of layers to encode the same amount of information may allow for a smaller total number of components. Using a smaller number of total components may be advantageous in terms of write costs.

[0088] In one example, one can start with two sets of unique nucleic acid sequences or layers, X and Y, each with x and y components (e.g., nucleic acid sequences), respectively. Each nucleic acid sequence from X can be assembled into each nucleic acid sequence from Y. The total number of nucleic acid sequences maintained in the two sets can be the sum of x and y, while the total number of nucleic acid molecules that can be produced, and therefore the total number of possible identifiers, can be the product of x and y. If sequences from X can be assembled into sequences of Y in any order, a much larger number of nucleic acid sequences (e.g., identifiers) can be produced. For example, the number of nucleic acid sequences (e.g., identifiers) produced can be twice the product of x and y if the assembly order is programmable. This set of all possible nucleic acid sequences that can be produced may be referred to as XY. The order of the assembled units of the unique nucleic acid sequences in XY can be controlled using nucleic acids with distinct 5' and 3' ends, as well as restriction digestion, ligation, polymerase chain reaction (PCR), and sequencing can occur with respect to the distinct 5' and 3' ends of the sequences. Such an approach can reduce the total number of nucleic acid sequences (e.g., building blocks) used to encode N distinct bits by encoding information in the combination and order of their assembly products. For example, to encode 100 bits of information, two layers of 10 distinct nucleic acid molecules (e.g., building blocks) may be assembled in a fixed order to yield 10*10 or 100 distinct nucleic acid molecules (e.g., identifiers), or one layer of 5 distinct nucleic acid molecules (e.g., building blocks) and another layer of 10 distinct nucleic acid molecules (e.g., building blocks) may be assembled in any order to yield 100 distinct nucleic acid molecules (e.g., identifiers).

[0089] The nucleic acid sequences (e.g., components) within each layer may contain a unique (or distinct) sequence, or barcode, in the middle, a common hybridization region on one end, and another common hybridization region on the other end. The barcode may contain a sufficient number of nucleotides to uniquely identify every sequence within the layer. For example, there are typically four possible nucleotides for each base position in the barcode. Thus, a three base barcode may contain four 3 A barcode may uniquely identify a nucleic acid sequence of 64 or more. The barcode may be designed to be randomly generated. Alternatively, the barcode may be designed to avoid sequences that create complications in the structural chemistry or sequencing of the identifier. Additionally, the barcodes may be designed so that each has a minimum Hamming distance from other barcodes, thereby reducing the likelihood that base resolution mutations or reading errors may interfere with proper identification of the barcode.

[0090] The hybridization regions on one end of the nucleic acid sequences (e.g., components) may be different in each layer, but the hybridization regions may be the same for each member within a layer. Adjacent layers are layers with complementary hybridization regions on components that allow them to interact with each other. For example, any component from layer X may be able to attach to any component from layer Y because they may have complementary hybridization regions. The hybridization region on the opposite end may serve the same purpose as the hybridization region on the first end. For example, any component from layer Y may attach to any component of layer X on one end and any component of layer Z on the opposite end.

[0091] 6A and 6B illustrate an exemplary method, called the "product approach," for constructing an identifier (e.g., a nucleic acid molecule) by combinatorially assembling separate components (e.g., nucleic acid sequences) from each layer in a fixed order. FIG. 6A illustrates the architecture of an identifier constructed using the product approach. An identifier may be constructed by combining a single component from each layer in a fixed order. For M layers, each with N components, N M There are 27 possible identifiers. Figure 6B illustrates an example of a combinatorial space of identifiers that may be constructed using the production method. In one example, the combinatorial space may be generated from three layers, each containing three separate components. The components may be combined such that one component from each layer may be combined in a fixed order. The entire combinatorial space for this assembly method may include 27 possible identifiers.

[0092] 7-10 illustrate a chemical method for implementing the product scheme (see FIG. 6). The methods depicted in FIGS. 7-10, along with any other method for assembling two or more separate components in a fixed order, may be used to produce, for example, any one or more identifiers in an identifier library. Identifiers may be constructed using any of the implementation methods described in FIGS. 7-10 at any time during the methods or systems disclosed herein. In some cases, all or a portion of the combinatorial space of possible identifiers may be constructed before digital information is encoded or written, in which case the writing process may involve mechanically selecting and pooling identifiers (that encode the information) from a pre-existing set. In other cases, identifiers may be constructed after one or more steps of the data encoding or writing process have occurred (i.e., as the information is being written).

[0093] Enzymatic reactions may be used to assemble components from different layers or sets. Because components (e.g., nucleic acid sequences) from each layer have specific hybridization or attachment regions to components from adjacent layers, assembly can occur in a one-pot reaction. For example, nucleic acid sequence (e.g., component) X1 from layer X, nucleic acid sequence Y1 from layer Y, and nucleic acid sequence Z1 from layer Z may form an assembled nucleic acid molecule (e.g., identifier) ​​X1Y1Z1. Additionally, multiple nucleic acid molecules (e.g., identifiers) may be assembled in a single reaction by including multiple nucleic acid sequences from each layer. For example, including both Y1 and Y2 in the one-pot reaction of the previous example may yield two assembled products (e.g., identifiers): X1Y1Z1 and X1Y2Z1. This reaction multiplexing may be used to speed up the writing time for physically constructing multiple identifiers. Assembly of nucleic acid sequences may be performed within a time period less than or equal to about 1 day, 12 hours, 10 hours, 9 hours, 8 hours, 7 hours, 6 hours, 5 hours, 4 hours, 3 hours, 2 hours, or 1 hour. The accuracy of the encoded data may be at least about 90%, 95%, 96%, 97%, 98%, 99%, or equal to or greater than these.

[0094] Identifiers may be constructed product-wise using overlap extension polymerase chain reaction (OEPCR), as illustrated in Figure 7. Each component within each layer may comprise a double-stranded or single-stranded (as depicted in the figure) nucleic acid sequence with a common hybridization region on the sequence end that may be homologous and / or complementary to the common hybridization region on the sequence end of a component from an adjacent layer. An individual identifier is composed of components X1-X A One component (e.g., a unique sequence) from layer X (or layer 1) containing Y1-Y A a second component (e.g., a unique sequence) from layer Y (or layer 2) containing Z1-Z BA unique identifier may be constructed by ligating a third component (e.g., a unique sequence) from layer Z (or layer 3) containing a single component from layer X. A component from layer X may have a 3' end that shares complementarity with a 3' end on a component from layer Y. Thus, single-stranded components from layers X and Y may be annealed together at their 3' ends and extended using PCR to generate a double-stranded nucleic acid molecule. The generated double-stranded nucleic acid molecule may be melted to generate a 3' end that shares complementarity with the 3' end of the component from layer Z. A component from layer Z may be annealed with the generated nucleic acid molecule and extended to generate a unique identifier containing single components from layers X, Y, and Z in a fixed order. DNA size selection (e.g., using gel extraction) or polymerase chain reaction (PCR) with the outermost layer and adjacent primers may be implemented to isolate the identifier product from other by-products that may form during the reaction.

[0095] Identifiers may be assembled by a product approach using sticky end ligation, as illustrated in Figure 8. Three layers, each containing a double-stranded building block (e.g., double-stranded DNA (dsDNA)) with a single-stranded 3' overhang, can be used to assemble a distinct identifier. For example, building blocks X1-X A One component from layer X (or layer 1) containing Y1-Y B a second component from layer Y (or layer 2) including Z1-Z Cand a third component from layer Z (or layer 3) comprising: To combine a component from layer X with a component from layer Y, the component in layer X can comprise a common 3' overhang, labeled a in FIG. 8, and the component in layer Y can comprise a common complementary 3' overhang, i.e., a*. To combine a component from layer Y with a component from layer Z, the element in layer Y can comprise a common 3' overhang, labeled b in FIG. 8, and the element in layer Z can comprise a common complementary 3' overhang, i.e., b*. The 3' overhang in the layer X component can be complementary to a 3' end in the layer Y component, and the other 3' overhang in the layer Y component can be complementary to a 3' end in the layer Z component, allowing the components to hybridize and ligate. Thus, a component from layer X cannot hybridize with other components from layer X or layer Z, and similarly, a component from layer Y cannot hybridize with other elements from layer Y. Moreover, a single component from layer Y can be ligated to a single component of layer X and a single component of layer Z to ensure the formation of a complete identifier. DNA size selection (e.g., using gel extraction) or PCR with primers flanking the outermost layer may be implemented to isolate the identifier product from other by-products that may form during the reaction.

[0096] Sticky ends for sticky-end ligation may be generated by treating each layer component with a restriction endonuclease. In some embodiments, multiple layer components may be generated from one "parent" set of components. For example, in one embodiment, a single parent set of double-stranded components may have complementary restriction sites on each end (e.g., restriction sites for BamHI and BglII). Any two components selected for assembly may be individually digested with one or the other complementary restriction enzyme (e.g., BglII or BamHI) to result in ligatable complementary sticky ends that result in an inert scar. The product nucleic acid sequence may contain complementary restriction sites on each end (e.g., BamHI on the 5' end and BglII on the 3' end) and may be further ligated to another component from the parent set following the same process. This process may be cyclical indefinitely. If the parent comprises N components, each cycle may be equivalent to adding an extra layer of N components to the product formula.

[0097] A method for using ligation to construct a sequence of nucleic acids containing elements from Set X (e.g., dsDNA Set 1) and elements from Set Y (e.g., dsDNA Set 2) can include obtaining or constructing two or more pools of double-stranded sequences (e.g., dsDNA Set 1 and dsDNA Set 2), where the first set (e.g., dsDNA Set 1) contains a sticky end (e.g., a) and the second set (e.g., dsDNA Set 2) contains a sticky end (e.g., a*) that is complementary to the sticky end of the first set. Any DNA from the first set (e.g., dsDNA Set 1) and any subset of DNA from the second set (e.g., dsDNA Set 2) can be combined, assembled, and then ligated together to form a single double-stranded DNA with elements from the first set and elements from the second set.

[0098] The identifier may be assembled in a product-based manner using site-specific recombination, as illustrated in Figure 9. The identifier may be constructed by assembling components from three different layers. Components in layer X (or layer 1) contain attB on one side of the molecule. x The components from layer Y (or layer 2) may contain double-stranded molecules with recombinase sites on one side and attP x The recombinase site is located on the other side of attB y The components in layer Z (or layer 3) may contain double-stranded molecules with recombinase sites, with attP on one side of the molecule. yThe attB and attP sites within a pair, indicated by subscripts, may recombine in the presence of the corresponding recombinase enzyme. One component from each layer may be combined such that one component from layer X is associated with one component from layer Y, and one component from layer Y is associated with one component from layer Z. Application of one or more recombinase enzymes may recombine the components to generate a double-stranded identifier containing the ordered components. DNA size selection (e.g., using gel extraction) or PCR with the outermost layer and adjacent primers may be implemented to isolate the identifier product from other by-products that may form during the reaction. Generally, multiple orthogonal attB and attP pairs may be used, and each pair may be used to assemble components from redundant layers. In the case of the large-serine family of recombinases, up to six orthogonal attB and attP pairs per recombinase may be generated, and multiple orthogonal recombinases may also be implemented. For example, 13 layers may be assembled by using 12 orthogonal attB and attP pairs, i.e., six orthogonal pairs from each of two large serine recombinases, such as BxbI and PhiC31. The orthogonality of the attB and attP pairs ensures that the attB site from one pair does not react with the attP site from another pair. This allows components from different layers to be assembled in a fixed order. Recombinase-mediated recombination reactions can be reversible or irreversible, depending on the recombinase system implemented. For example, the large serine recombinase family catalyzes irreversible recombination reactions without requiring high-energy cofactors, while the tyrosine recombinase family catalyzes reversible reactions.

[0099] Identifiers may be constructed by a product approach using template-directed ligation (TDL), as illustrated in Figure 10A. Template-directed ligation utilizes single-stranded nucleic acid sequences called "templates" or "staples" to facilitate ordered ligation of components to form the identifier. The templates simultaneously hybridize to components from adjacent layers, holding them adjacent to each other (3' ends to 5' ends) while a ligase ligates them. In the example from Figure 10A, three layers or sets of single-stranded components are combined. a first layer (e.g., Layer X or Layer 1) of components sharing common sequence a on their 3' ends, which is complementary to sequence a*; a second layer (e.g., Layer Y or Layer 2) of components sharing common sequences b and c on their 5' and 3' ends, which are complementary to sequences b* and c*, respectively; a third layer (e.g., Layer Z or Layer 3) of components sharing common sequence d on their 5' ends, which may be complementary to sequence d*; and a set of two templates or "staples," with a first staple comprising sequence a*b* (5' to 3') and a second staple comprising sequence c*d* ('5 to 3'). In this example, one or more components from each layer may be selected and mixed into a reaction with the staples, which may facilitate ligation of one component from each layer in a defined order to form an identifier by complementary annealing. DNA size selection (e.g., using gel extraction) or PCR with the outermost layer and adjacent primers may be implemented to isolate the identifier product from other by-products that may form during the reaction.

[0100] Figure 10B shows a histogram of copy numbers (abundances) of 256 distinct nucleic acid sequences, each assembled with a six-layer TDL. The edge layers (the first and last layers) each contained one component, and the interior layers (the remaining four layers) each contained four components. Each edge layer component was 28 bases long, including a 10-base hybridization region. Each interior layer component was 30 bases long, including a 10-base common hybridization region on the 5' end, a 10-base variable (barcode) region, and a 10-base common hybridization region on the 3' end. Each of the three template strands was 20 bases long. All 256 distinct sequences were assembled in a multiplexed manner, with one reaction containing all of the components and templates, T4 polynucleotide kinase (to phosphorylate the components), T4 ligase, ATP, and other appropriate reaction reagents. The reactions were incubated at 37°C for 30 minutes, then at room temperature for 1 hour. Sequencing adaptors were added to the PCR reaction products, and the products were sequenced using an Illumina MiSeq instrument. The relative copy number of each distinct assembled sequence from the 192,910 total assembled sequence reads is shown. Other embodiments of this method may use double-stranded building blocks, which are initially melted to form single-stranded versions that can anneal to staples. Other embodiments or derivatives of this method (i.e., TDL) may be used to construct a more complex combinatorial space of identifiers than can be achieved in a product approach.

[0101] Identifiers may be constructed product-wise using a variety of other chemical implementations, including Golden Gate assembly, Gibson assembly, and ligase cycling reaction assembly.

[0102] 11A and 11B schematically illustrate an exemplary method, called a "permutation scheme," for constructing an identifier (e.g., a nucleic acid molecule) with permuted components (e.g., a nucleic acid sequence). FIG. 11A illustrates the architecture of an identifier constructed using the permutation scheme. An identifier may be constructed by combining a single component from each layer in a programmable order. FIG. 11B illustrates an example of an identifier combinatorial space that may be constructed using the permutation scheme. In one example, a combinatorial space of size 6 may be generated from three layers, each containing one distinct component. The components may be concatenated in any order. In general, for M layers with N components each, the permutation scheme may be used to construct an identifier by combining N M This allows for a combinatorial space of M! total identifiers.

[0103] FIG. 11C illustrates one exemplary implementation of a sorting scheme with template-directed ligation (TDL). Components from multiple layers are assembled intermediate fixed left and right end components, called edge scaffolds. These edge scaffolds are the same for all identifiers in the combination space and may therefore be added as part of a reaction master mix for implementation. A template or staple exists for every possible junction between any two layers or scaffolds, such that the order in which components from different layers are incorporated into the identifier in a reaction depends on the template selected for the reaction. To allow for any possible permutation of layers for M layers, M layers are assigned to every possible junction (including junctions with scaffolds). 2There may be +2M distinct selectable staples. M of these templates (shaded gray) form junctions between the layer and itself and may be excluded for the purposes of sorting assembly described herein. However, their inclusion may allow for a larger combinatorial space with identifiers containing repeating components, as exemplified in Figures 11D-11G. DNA size selection (e.g., using gel extraction) or PCR with primers targeting edge scaffolds may be implemented to isolate the identifier product from other by-products that may form during the reaction.

[0104] 11D-11G illustrate an example way how the permutation scheme can be extended to include several instances of identifiers with repeated elements. FIG. 11D shows an example of how the implementation from FIG. 11C can be used to construct an identifier with permuted repeated elements. For example, the identifier may include three total elements assembled from two separate elements. In this example, elements from a layer may be present multiple times within the identifier. Adjacent linkage of identical elements may be achieved by using staples with adjacent complementary hybridization regions to both the 3' and 5' ends of the same element, such as the a*b*(5' to 3') staple in the figure. Generally, for M layers, there are M such staples. Incorporation of repeated elements with this implementation may generate nucleic acid sequences of greater than one length (i.e., including one, two, three, four, or more elements) assembled between edge scaffolds as shown in FIG. 11E. FIG. 11E shows how the example implementation from FIG. 11D can lead to non-target nucleic acid sequences, other than the identifier, being assembled between edge scaffolds. The appropriate identifier cannot be isolated from the non-target nucleic acid sequences using PCR because they share the same primer binding site on the edge. However, in this example, DNA size selection (e.g., using gel extraction) may be implemented to isolate the target identifier (e.g., the second sequence from above) from the non-target sequences, since each assembled nucleic acid sequence can be designed to have a unique length (e.g., if all components have the same length). FIG. 11F illustrates another example in which constructing an identifier using repeated components can generate multiple nucleic acid sequences with identical edge sequences but distinct lengths in the same reaction. In this method, a template may be used that assembles components in one layer with components in other layers in an alternating pattern. Similar to the method shown in FIG. 11E, size selection may be used to select identifiers of a designed length.Figure 11G shows an example where constructing an identifier using repeated building blocks may generate multiple nucleic acid sequences with equal edge sequences and, in the case of some nucleic acid sequences (e.g., the third and fourth sequences from the top and the sixth and seventh sequences from the top), equal lengths. In this example, those nucleic acid sequences that share equal length may be excluded from both individual identifiers because it may not be possible to construct one without also constructing the other, even when PCR and DNA size selection are implemented.

[0105] 12A-12D schematically illustrate an exemplary method, referred to as the "MchooseK scheme," for constructing an identifier (e.g., a nucleic acid molecule) with any number K of assembled components (e.g., nucleic acid sequences) from a larger number M of possible components. FIG. 12A illustrates the architecture of an identifier constructed using the MchooseK scheme. Using this method, identifiers are constructed by assembling one component from each layer in any subset of all layers (e.g., choosing components from k layers out of M possible layers). FIG. 12B illustrates an example of a combinatorial space of identifiers that may be constructed using the MchooseK scheme. In this assembly scheme, the combinatorial space is constructed by assembling one component from each layer in any subset of all layers (e.g., choosing components from k layers out of M possible layers). K MchooseK may contain possible identifiers, N components per layer, and an identifier length of K components. In one example, if there are five layers, each containing one component, then up to 10 separate identifiers, each containing two components, may be constructed.

[0106] The MchooseK method may be implemented using template-directed ligation, as illustrated in FIG. 12C. Similar to the TDL implementation for the sorting method (FIG. 11C), the components in this example are assembled between edge scaffolds that may or may not be included in the reaction master mix. The components may be divided into M layers, e.g., M=4 layers, with predefined ranks from 2 to M, where the left edge scaffold may be rank 1 and the right edge scaffold may be rank M+1. The template contains nucleic acid sequences for 3' to 5' ligation of any two components with lower to higher ranks, respectively. ((M+1) 2 There are (M+1) / 2 such templates. Individual identifiers for any K components from distinct layers may be constructed by combining those selected components in a ligation reaction with corresponding K+1 staples used to join the K components to edge scaffolds in rank order. Such a reaction setup may yield nucleic acid sequences corresponding to target identifiers between edge scaffolds. Alternatively, a reaction mix containing all templates may be combined with selected components to assemble the target identifier. This alternative method may generate various nucleic acid sequences with the same edge sequence but distinct lengths (if all component lengths are equal), as illustrated in Figure 12D. The target identifier (bottom) may be separated from the by-product nucleic acid sequences by size.

[0107] 13A and 13B schematically illustrate an exemplary method, called a "partition scheme," for constructing identifiers with partitioned components. FIG. 13A is a diagram illustrating an example of an identifier combination space that can be constructed using the partition scheme. Individual identifiers may be constructed by assembling one component from each layer in a fixed order, with the optional placement of any partition (specially classified component) between any two components from different layers. For example, a set of components may be organized into one partition component and four layers containing one component each. Components from each layer may be combined in a fixed order, and a single partition component may be assembled in various locations between the layers. Identifiers in this combination space may not include partition components, partition components between components from the first and second layers, partitions between components from the second and third layers, etc., to create a combination space of eight possible identifiers. In general, with M layers, each with N components, and p partition components, N possible identifiers may be constructed. K (p+1) M-1 There are possible identifiers. The method can generate identifiers of various lengths.

[0108] Figure 13B illustrates an exemplary implementation of a partitioning scheme using template-directed ligation. The templates contain nucleic acid sequences for ligating one component from each of M layers together in a fixed order. For each partition component, there is an additional pair of templates that allows the partition component to ligate in-between components from any two adjacent layers. For example, one template in the pair (e.g., with sequence g*b*(5' to 3')) allows the 3' end of layer 1 (with sequence b) to ligate to the 5' end of the partition component (with sequence g), and the second template in the pair (e.g., with sequence c*h*(5' to 3')) allows the 3' end of the partition component (with sequence h) to ligate to the 5' end of layer 2 (with sequence c). To insert a partition between any two components of adjacent layers, the standard template for ligating those layers together can be omitted from the reaction, and a template pair for ligating the partition at that position can be selected in the reaction. In the current example, targeting partition components between layer 1 and layer 2 may use a pair of templates c*h* (5' to 3') and g*b* (5' to 3') to select for reaction rather than template c*b* (5' to 3'). Components may be assembled between edge scaffolds, which may be included in the reaction mix (along with their corresponding templates for ligation to the first and Mth layers, respectively). Generally, a total of approximately M-1+2*p*(M-1) selectable templates may be used in this method for M layers and p partition components. This implementation of the partition method may generate various nucleic acid sequences of different lengths when reacting with the same edge sequence but edge sequences with different lengths. The target identifier may be isolated from by-product nucleic acid sequences by DNA size selection. Specifically, there may be exactly one nucleic acid sequence product with exactly M layer components.If the layer components are designed to be sufficiently large compared to the partition components, it may be possible to define a generic size selection region whereby identifiers may be selected regardless of the specific partition of components within the identifier (none of the non-target by-products are selected), thereby allowing multiple partitioned identifiers from multiple reactions to be isolated in the same size selection step.

[0109] 14A and 14B are diagrams that schematically illustrate an exemplary method, called the "unconstrained string" method or "USS," for constructing identifiers composed of any string of components from several possible components. FIG. 14A illustrates an example of the combinatorial space of three-component (or four-scaffold) length identifiers that can be constructed using the unconstrained string method. The unconstrained string method constructs individual identifiers of length K components, each with one or more distinct components taken from one or more layers, where each distinct component can appear in any of K component positions within the identifier (allowing for repetition). For example, with two layers, each containing one component, there are eight possible three-component length identifiers. In general, with M layers, each with one component, there are M possible three-component length identifiers of length K components. KThere are K+1 possible identifiers. Figure 14B illustrates an exemplary implementation of the unconstrained string method using template-directed ligation. In this method, K+1 single-stranded and ordered scaffold DNA components (including two edge scaffolds and K-1 internal scaffolds) are present in the reaction mix. Each identifier contains a single component ligated between every pair of adjacent scaffolds. For example, the component ligated between scaffolds A and B, the component ligated between scaffolds C and D, etc., is populated by a component until all K adjacent scaffolds are joined. During the reaction, selected components from different layers are introduced to the scaffold along with selected staple pairs that direct assembly onto the appropriate scaffold. For example, a pair of staples a*L*(5' to 3') and A*b*(5' to 3') directs a layer 1 component with a 5'-end region "a" and a 3'-end region "b" to ligate midway between the L and A scaffolds. In general, with M layers and K+1 scaffolds, 2*M*K selectable staples may be used to construct any USS identifier of length K. Because the staple connecting a component to a scaffold on the 5' end is disassembled from the staple connecting the same component to a scaffold on the 3' end, nucleic acid by-products may form in reactions with edge scaffolds equal to the target identifier but with fewer than K components (fewer than K+1 scaffolds) or more than K components (more than K+1 scaffolds). A target identifier may be formed with exactly K building blocks (K+1 scaffolds) and may therefore be selectable through techniques such as DNA size selection if all building blocks are designed to be equal in length and all scaffolds are designed to be equal in length.In certain embodiments of the open-string approach, where there may be one component per layer, the component may comprise only a single distinct nucleic acid sequence that serves all three roles: (1) an identification barcode, (2) a hybridization region for staple-mediated ligation of the 5' end to the scaffold, and (3) a hybridization region for staple-mediated ligation of the 3' end to the scaffold.

[0110] The internal scaffold illustrated in Figure 14B may be designed to use the same hybridization sequence for both staple-mediated 5' ligation of the scaffold to a building block and staple-mediated 3' ligation of the scaffold to another (not necessarily separate) building block. Thus, the single scaffold, two-staple stacked hybridization event depicted in Figure 14B represents a statistical back-and-forth hybridization event that occurs between the scaffold and each of the staples, thus allowing both 5' and 3' building block ligation. In other embodiments of the open-string approach, the scaffold may be designed with two linked hybridization regions—a separate 3' hybridization region for staple-mediated 3' ligation and a separate 5' hybridization region for staple-mediated 5' ligation.

[0111] Figures 15A and 15B schematically illustrate an exemplary method, called the "component removal scheme," for constructing identifiers by removing nucleic acid sequences (or components) from parent identifiers. Figure 15A is a diagram illustrating one example of a combinatorial space of possible identifiers that can be constructed using the component removal scheme. In this example, the parent identifier may include multiple components. The parent identifier may include greater than or equal to about 2, 3, 4, 5, 6, 7, 8, 9, 10, 20, 30, 40, 50, or more components. Individual identifiers can be constructed by selectively removing any number of components from the N possible components, resulting in a combinatorial space of size 2 N or by removing a fixed number K components from the N possible components, thus arriving at an "NchooseK" combination space of size NchooseK. In an example with a parent identifier with three components, the full combination space may be 8 and the 3choose2 combination space may be 3.

[0112] Figure 15B illustrates an exemplary implementation of a building block deletion scheme using double-stranded targeted cleavage and repair (DSTCR). A parent sequence may be a single-stranded DNA substrate containing building blocks flanked by nuclease-specific target sites (which can be four or fewer bases in length), and the parent may be incubated with one or more double-stranded-specific nucleases corresponding to the target sites. Individual building blocks may be targeted for deletion using a complementary single-stranded DNA (or cleavage template) that binds to the building block DNA (and adjacent nuclease sites) on the parent, thus forming a stable double-stranded sequence on the parent that can be cleaved by the nuclease on both ends. Another single-stranded DNA (or repair template) hybridizes to the resulting disjoint ends of the parent (between which the building block sequences were) and brings them together for ligation, either directly or bridged by a replacement sequence; thus, the ligation sequence on the parent no longer contains an active nuclease target site. This method is called "double-stranded targeted cleavage" (DSTC). Size selection may be used to select identifiers with a certain number of deleted components.

[0113] Alternatively, or in addition, the parent identifier may be a double-stranded or single-stranded nucleic acid substrate containing components separated by a spacer sequence so that no two components are flanked by the same sequence. The parent identifier may be incubated with Cas9 nuclease. Individual components may be targeted for deletion using a guide ribonucleic acid (cleavage template) that binds to the edges of the components and enables Cas9-mediated cleavage at adjacent sites. A single-stranded nucleic acid (repair template) may hybridize to the resulting disassembled ends of the parent identifier (e.g., between the ends where the component sequences were), thus bringing them together for ligation. Ligation may be done directly or by bridging the ends with a replacement sequence so that the ligation sequence on the parent no longer contains a spacer sequence that can be targeted by Cas9. This method is called "sequence-specific targeted cleavage and repair" or "SSTCR."

[0114] Identifiers may be constructed by inserting building blocks into parent identifiers using derivatives of DSTCRs. The parent identifiers may be single-stranded nucleic acid substrates, each containing a nuclease-specific target site (which may be 4 or fewer bases in length) embedded within a distinct nucleic acid sequence. The parent identifiers may be incubated with one or more double-stranded-specific nucleases corresponding to the target sites. Each target site on the parent identifier may be targeted for building block insertion with a complementary single-stranded nucleic acid (cleavage template) that binds the target site to a distinct surrounding nucleic acid sequence on the parent identifier, thus forming a double-stranded site. This double-stranded site may be cleaved by a nuclease. Another single-stranded nucleic acid (repair template) may hybridize to the resulting disassembled ends of the parent identifier, bringing them together for ligation bridged by the building block sequences; thus, the ligation sequence on the parent no longer contains an active nuclease target site. Alternatively, derivatives of SSTCRs may be used to insert building blocks into parent identifiers. The parent identifier may be a double-stranded or single-stranded nucleic acid, and the parent may be incubated with Cas9 nuclease. Separate sites on the parent identifier may be targeted for cleavage using a guide RNA (cleavage template). A single-stranded nucleic acid (repair template) may hybridize to the disassembled ends of the parent identifier, bringing them together for ligation and bridged by the component sequences, so that the ligation sequences on the parent identifier no longer contain active nuclease target sites. Size selection may be used to select identifiers with a certain number of component insertions.

[0115] Figure 16 illustrates a schematic of a parent identifier with recombinase recognition sites. Different patterns of recognition sites are recognizable by different recombinases. All recognition sites for a given set of recombinases are positioned such that their intermediate nucleic acid can be excised when the recombinase is applied. The nucleic acid strand illustrated in Figure 16 can be split into two strands depending on the subset of recombinases applied to it. 5= 32 different sequences can be employed. In some embodiments, unique molecules can be generated using recombinases to excise, shift, invert, and transpose segments of DNA to create different nucleic acid molecules, as depicted in Figure 16. Generally, N recombinases will N In some embodiments, multiple orthogonal pairs of recognition sites from different recombinases can be arranged on a parent identifier in an overlapping manner, such that the application of one recombinase influences the type of recombination event that occurs when a downstream recombinase is applied (Roquet et al., Synthetic See, "Recombinase-Based State Machines in Living Cells," Science 353(6297):aad8559 (2016), which is incorporated herein by reference in its entirety. Such a system may be capable of constructing a different identifier for every permutation of N recombinases, i.e., N!. The recombinases may be from the tyrosine family, such as Flp and Cre, or from the large serine recombinase family, such as PhiC31, BxbI, TP901, or A118. The use of recombinases from the large serine recombinase family may be advantageous because these recombinases facilitate irreversible recombination and, therefore, may generate identifiers more efficiently than other recombinases.

[0116] In some cases, a single nucleic acid sequence can be programmed to become a multitude of distinct nucleic acid sequences by applying numerous recombinases in distinct orders. When the number of recombinases, M, can be less than or equal to 7 for the large serine recombinase family, approximately e 1M distinct nucleic acid sequences can be generated by applying M recombinases in different orders within different subsets. When the number of recombinases, i.e., M, can be greater than 7, the number of possible sequences that can be generated is 3.9. M (1999). See, for example, Roquet et al., Synthetic recombinase-based state machines in living cells, Science 353(6297):aad8559 (2016), which is incorporated herein by reference in its entirety. Additional methods for generating different DNA sequences from a single consensus sequence include targeted nucleic acid editing enzymes such as CRISPR-Cas, TALENS, and zinc finger nucleases. Sequences generated by recombinases, targeted editing enzymes, and the like, can be used in conjunction with any of the previous methods, for example, the methods disclosed in any of the figures and disclosures in this application.

[0117] If the bitstream of information to be encoded is larger than can be encoded by any single nucleic acid molecule, the information can be partitioned and indexed with nucleic acid sequence barcodes. Furthermore, any subset of nucleic acid molecules of size k from a set of N nucleic acid molecules can be chosen to yield log2(Nchoosek) bits of information. Barcodes can be assembled on nucleic acid molecules in the subset of size k to encode much longer bitstreams. For example, M barcodes can be used to generate M*log2(Nchoosek) bits of information. Given a certain number N of available nucleic acid molecules in the set and a certain number M of available barcodes, a subset of size k=k0 can be chosen to minimize the total number of molecules in the pool to encode one piece of information. A method for encoding digital information can include subdividing the bitstream and encoding individual elements. For example, a bitstream containing 6 bits can be divided into three components, each containing 2 bits. Each 2-bit component can be barcoded to form an information cassette and grouped or pooled together to form a hyperpool of information cassettes.

[0118] Barcodes can facilitate information indexing when the amount of digital information to be encoded exceeds the amount that can be accommodated in a single pool. Information containing longer strings of bits and / or multiple bytes can be encoded by layering the approach disclosed in FIG. 3 , for example, by including tags with unique nucleic acid sequences encoded using nucleic acid indexes. An information cassette or identifier library can include nitrogen bases or nucleic acid sequences containing unique nucleic acid sequences that provide location and bit value information in addition to barcodes or tags that indicate one or more components of the bit stream to which a given sequence corresponds. An information cassette can include one or more unique nucleic acid sequences and barcodes or tags. A barcode or tag on an information cassette can provide a reference to the information cassette and any sequences contained within the information cassette. For example, a tag or barcode on an information cassette can indicate which portion of a bit component of a bit stream or bit steam the unique sequence encodes information (e.g., bit value and bit position information).

[0119] Using barcodes, more information in bits can be encoded in a pool than the size of the combinatorial space of possible identifiers. A 10-bit sequence can, for example, be separated into two sets of bytes, each containing five bits. Each byte can be mapped to a set of five possible distinct identifiers. Initially, the identifiers generated for each byte can be the same, but these identifiers can be kept in separate pools; otherwise, someone reading the information may not be able to tell which byte a particular nucleic acid sequence belongs to. However, each identifier can be barcoded or tagged with a label corresponding to the byte to which the encoded information applies (e.g., barcode 1 can be attached to a sequence in a nucleic acid pool to provide the first five bits, and barcode 2 can be attached to a sequence in a nucleic acid pool to provide the second five bits), and then the identifiers corresponding to the two bytes can be combined into one pool (e.g., a "hyperpool" or one or more identifier libraries). Each identifier library of one or more combined identifier libraries can include a distinct barcode that identifies a given identifier as belonging to the given identifier library. Methods for adding barcodes to each identifier in the identifier library can include using PCR, Gibson, ligation, or any other technique that allows a given barcode (e.g., barcode 1) to be attached to a given nucleic acid sample pool (e.g., barcode 1 to nucleic acid sample pool 1, barcode 2 to nucleic acid sample pool 2). Samples from the hyperpool can be read using sequencing methods, and the sequencing information can be analyzed using the barcodes or tags. Methods that use the identifier library and barcodes with a set of M barcodes and N possible identifiers (combinatorial space) can encode a stream of bits with a length equal to the product of M and N.

[0120] In some embodiments, the identifier libraries may be stored in an array of wells. The array of wells may be defined as having n columns and q rows, and each well may contain two or more identifier libraries in a hyperpool. The information encoded in each well may constitute one large contiguous item of information of size n x q, larger than the information contained in each of the wells. An aliquot may be taken from one or more of the wells in the array of wells, and the encoding may be read using sequencing, hybridization, or PCR.

[0121] A nucleic acid sample pool, hyperpool, identifier library, group of identifier libraries, or well containing a nucleic acid sample pool or hyperpool may contain a unique nucleic acid molecule (e.g., an identifier) ​​corresponding to a bit of information and multiple complementary nucleic acid sequences. The complementary nucleic acid sequence may not correspond to encoded data (e.g., not correspond to a bit value). The complementary nucleic acid sample may mask or encrypt the information stored in the sample pool. The complementary nucleic acid sequence may be derived from a biological source or synthetically generated. Complementary nucleic acid sequences derived from a biological source may include randomly fragmented nucleic acid sequences or rationally fragmented sequences. Biologically derived complementary nucleic acids may conceal or obscure data-containing nucleic acids in the sample pool by providing natural genetic information along with synthetically encoded information, particularly when the synthetically encoded information (e.g., the combinatorial space of identifiers) is created to resemble natural genetic information (e.g., a fragmented genome). In one example, the identifier is derived from a biological source and the complementary nucleic acids are derived from a biological source. A sample pool may contain multiple sets of identifiers and complementary nucleic acid sequences. Each set of identifiers and complementary nucleic acid sequences may be derived from different organisms. In one example, the identifiers are derived from one or more organisms and the complementary nucleic acid sequences are derived from a single, different organism. The complementary nucleic acid sequences may also be derived from one or more organisms, and the identifiers may be derived from a single organism that is different from the organism from which the complementary nucleic acids are derived. Both the identifiers and complementary nucleic acid sequences may be derived from multiple different organisms. A key may be used to distinguish the identifiers from the complementary nucleic acid sequences.

[0122] The supplemental nucleic acid sequence may store metadata about the written information. The metadata may include redundant information for determining and / or authorizing the source of the original information and / or the intended recipient of the original information. The metadata may include redundant information about the format of the original information, the equipment and method used to encode and write the original information, and the date and time of writing the original information to the identifier. The metadata may include additional information about the format of the original information, the equipment and method used to encode and write the original information, and the date and time of writing the original information to the nucleic acid sequence. The metadata may include additional information about modifications made to the original information after the information was written to the nucleic acid sequence. The metadata may include annotations to the original information or one or more references to external information. Alternatively, or in addition, the metadata may be stored in one or more barcodes or tags attached to the identifier.

[0123] The identifiers in an identifier pool may have the same length, similar lengths, or different lengths from each other. The complementary nucleic acid sequences may have lengths shorter than, substantially equal to, or longer than the length of the identifiers. The complementary nucleic acid sequences may have an average length that is within 1 base, 2 bases, 3 bases, 4 bases, 5 bases, 6 bases, 7 bases, 8 bases, 9 bases, 10 bases, or more bases of the average length of the identifiers. In one example, the complementary nucleic acid sequences are the same or substantially the same length as the identifiers. The concentration of the complementary nucleic acid sequences may be less than, substantially equal to, or greater than the concentration of the identifiers in the identifier library. The concentration of the complementary nucleic acid may be about 1%, 10%, 20%, 40%, 60%, 80%, 100%, 125%, 150%, 175%, 200%, 1000%, 1×10 4 %, 1×10 5 %, 1×10 6 %, 1×10 7 %, 1×10 8The concentration of the complementary nucleic acid may be less than or equal to about 1%, 10%, 20%, 40%, 60%, 80%, 100%, 125%, 150%, 175%, 200%, 1000%, 1×10 4 %, 1×10 5 %, 1×10 6 %, 1×10 7 %, 1×10 8 %, or may be greater than the concentration of the identifiers. A greater concentration may be beneficial for obfuscation or data concealment. In one example, the concentration of complementary nucleic acid sequences is substantially greater than the concentration of identifiers in the identifier pool (e.g., 1×10 8 %big).

[0124] Methods for copying and accessing data stored in nucleic acid sequences In another aspect, the present disclosure provides a method for copying information encoded in a nucleic acid sequence. The method for copying information encoded in a nucleic acid sequence may include (a) providing an identifier library and (b) constructing one or more copies of the identifier library. The identifier library may include a subset of a plurality of identifiers from a larger combinatorial space. Each individual identifier of the plurality of identifiers may correspond to an individual symbol in a string of symbols. The identifier may include one or more components. The components may include a nucleic acid sequence.

[0125] In another aspect, the present disclosure provides a method for accessing information encoded in a nucleic acid sequence. The method for accessing information encoded in a nucleic acid sequence may include (a) providing an identifier library and (b) extracting from the identifier library a portion or subset of identifiers present in the identifier library. The identifier library may include a subset of a plurality of identifiers from a larger combinatorial space. Each individual identifier of the plurality of identifiers may correspond to an individual symbol in a string of symbols. The identifier may include one or more components. The components may include a nucleic acid sequence.

[0126] Information may be written to one or more identifier libraries as described elsewhere herein. Identifiers may be constructed using any of the methods described elsewhere herein. Stored data may be copied by generating copies of individual identifiers within the identifier library or within one or more identifier libraries. Portions of identifiers may be copied, or the entire library may be copied. Copying may be performed by amplifying identifiers within the identifier library. When one or more identifier libraries are combined, a single identifier library or multiple identifier libraries may be copied. If an identifier library includes a supplemental nucleic acid sequence, the supplemental nucleic acid sequence may or may not be copied.

[0127] Identifiers in an identifier library may be constructed to include one or more common primer binding sites. The one or more binding sites may be located on the edge of each identifier or may be intermingled throughout each identifier. The primer binding sites may allow an identifier library-specific primer pair or a universal primer pair to bind to and amplify the identifier. All of the identifiers in an identifier library or all of the identifiers in one or more identifier libraries may be replicated multiple times through multiple PCR cycles. Conventional PCR may be used to copy the identifiers, and the identifiers may be replicated exponentially with each PCR cycle. The number of identifier copies may increase exponentially with each PCR cycle. Linear PCR may be used to copy the identifiers, and the identifiers may be replicated linearly with each PCR cycle. The number of identifier copies may increase linearly with each PCR cycle. Identifiers may be ligated into a circular vector prior to PCR amplification. The circular vector may include a barcode at each end of the identifier insertion site. PCR primers for amplifying the identifier may be designed to prime the vector so that the barcoded edges are included with the identifier in the amplification product. During amplification, recombination between identifiers may result in copied identifiers containing uncorrelated barcodes on each edge. Uncorrelated barcodes may be detectable when reading the identifier. Identifiers containing uncorrelated barcodes may be considered false positives and may be ignored during the information decoding process.

[0128] Information may be encoded by assigning each bit of information to a unique nucleic acid molecule. For example, three sample sets (X, Y, and Z), each containing two nucleic acid sequences, may be assembled into eight unique nucleic acid molecules to encode eight bits of data. N1=X1Y1Z1 N2=X1Y1Z2 N3=X1Y2Z1 N4=X1Y2Z2 N5=X2Y1Z1 N6=X2Y1Z2 N7=X2Y2Z1 N8=X2Y2Z2 Each bit in the string may then be assigned to a corresponding nucleic acid molecule (e.g., N1 may designate the first bit, N2 may designate the second bit, N3 may designate the third bit, etc.). The entire bit string may be assigned to a combination of nucleic acid molecules whose combination or pool includes nucleic acid molecules corresponding to a bit value of "1." For example, in UTF-8 coding, the letter "K" may be represented by the 8-bit string code 01001011, which may be encoded by the presence of four nucleic acid molecules (e.g., X1Y1Z2, X2Y1Z1, X2Y2Z1, and X2Y2Z2 in the example above).

[0129] The information may be accessed through sequencing or hybridization assays. For example, primers or probes may be designed to bind to the common region or barcoded region of a nucleic acid sequence. This may allow for amplification of any region of the nucleic acid molecule. The amplification product may then be read by sequencing the amplification product or by hybridization assays. In the above example encoding the character "1C," if the first half of the data is a primer of interest specific to the barcode region of the X1 nucleic acid sequence, a primer binding to the common region of the Z set may be used to amplify the nucleic acid molecule. This may return the sequence Y1Z2, which may encode for 0100. Substrings of that data may also be accessed by further amplifying the nucleic acid molecule with a primer binding to the barcode region of the Y1 nucleic acid sequence and a primer binding to the common sequence of the Z set. This may return the Z2 nucleic acid sequence encoding the substring 01. Alternatively, data may be accessed by checking for the presence or absence of a specific nucleic acid sequence without sequencing. For example, amplification using primers specific for the Y2 barcode may generate an amplification product for the Y2 barcode but not for the Y1 barcode. The presence of the Y2 amplification product may signal a bit value of "1." Alternatively, the absence of the Y2 amplification product may signal a bit value of "0."

[0130] PCR-based methods can be used to access and copy data from identifiers or nucleic acid sample pools. Using common primer binding sites adjacent to the identifiers within the pool or hyperpool, information-containing nucleic acids can be easily copied. Alternatively, other nucleic acid amplification techniques, such as isothermal amplification, may also be used to easily copy data from sample pools or hyperpools (e.g., identifier libraries). In cases where a sample contains a hyperpool, a specific subset of information (e.g., all nucleic acids associated with a particular barcode) can be accessed and retrieved by using a primer that forward-binds a unique barcode on one edge of the identifier, along with another primer that reverse-binds a common sequence on the opposite edge of the identifier. Various readout methods can be used to extract information from the encoded nucleic acids. For example, microarrays (or any type of fluorescent hybridization), digital PCR, quantitative PCR (qPCR), and various sequencing platforms can further be used to read out the encoded sequences and, by extension, the digitally encoded data.

[0131] Accessing information stored within nucleic acid molecules (e.g., identifiers) may be performed by selectively removing a portion of non-target identifiers from an identifier library or pool of identifiers, or, for example, selectively removing all identifiers in an identifier library from a pool of multiple identifier libraries. Accessing data may also be performed by selectively capturing target identifiers from an identifier library or pool of identifiers. The target identifier may correspond to data of interest within a larger item of information. The pool of identifiers may include complementary nucleic acid molecules. The complementary nucleic acid molecules may contain metadata about the encoded information or may be used to encrypt or mask the identifiers corresponding to the information. The complementary nucleic acid molecules may or may not be extracted during access to the target identifiers. Figures 17A-17C schematically illustrate an exemplary method for accessing a portion of information stored within a nucleic acid sequence by accessing certain specific identifiers from a larger number of identifiers. Figure 17A illustrates an exemplary method for accessing identifiers containing specified components using polymerase chain reaction, affinity tag probes, and degraded target probes. In the case of PCR-based access, the pool of identifiers (e.g., an identifier library) may include identifiers with a common sequence at each end, a variable sequence at each end, or one of a common sequence or a variable sequence at each end. The common sequence or variable sequence may be a primer binding site. One or more primers may bind to the common region or the variable region on the identifier edge. The identifiers with bound primers may be amplified by PCR. The amplified identifiers may significantly outnumber the unamplified identifiers. During reading, the amplified identifiers may be identified. Identifiers from an identifier library may contain a sequence on one or both of its ends that is distinct to that library, thus allowing a single library to be selectively accessed from a pool or group of more than one identifier library.

[0132] In the case of affinity tag-based access, the components constituting the identifier in the pool may share complementarity with one or more probes. The one or more probes may bind or hybridize to the identifier to be accessed. The probe may include an affinity tag. The affinity tag may bind to a bead, generating a complex including the bead, at least one probe, and at least one identifier. The beads may be magnetic, and together with a magnet, the beads may collect and sequester the identifier to be accessed. The identifier may be removed from the beads under denaturing conditions before reading. Alternatively, or in addition, the beads may collect non-target identifiers and sequester them from the rest of the pool, where they can be washed into a separate container and read. The affinity tag may be bound to a column. The identifier to be accessed may be bound to the column for capture. The column-bound identifier may then be eluted or denatured from the column before reading. Alternatively, non-target identifiers may be selectively targeted to the column, while the target identifier may flow through the column. Accessing the target identifiers may involve applying one or more probes simultaneously to the pool of identifiers, or applying one or more probes sequentially to the pool of identifiers.

[0133] In the case of degradation-based access, the components constituting the identifiers in the pool may share complementarity with one or more degradation target probes. The probes may bind to or hybridize to distinct components on the identifiers. The probes may be targeted by a degradative enzyme, such as an endonuclease. In one example, one or more identifier libraries may be combined. A set of probes may hybridize with one of the identifier libraries. The set of probes may include RNA, which may guide a Cas9 enzyme. The Cas9 enzyme may be introduced into one or more identifier libraries. Identifiers hybridized with the probes may be degraded by the Cas9 enzyme. Identifiers to be accessed may not be degraded by the degradative enzyme. In another example, the identifiers may be single-stranded, and the identifier library may be combined with a single-strand-specific endonuclease, such as S1 nuclease, which selectively degrades identifiers to be inaccessible. Identifiers to be accessed may be hybridized with a complementary set of identifiers to protect them from degradation by the single-strand-specific endonuclease. The identifier to be accessed may be separated from the degradation products by size selection, such as by size-selective chromatography (e.g., agarose gel electrophoresis). Alternatively, or in addition, the undegraded identifier may be selectively amplified (e.g., using PCR) so that the degradation products are not amplified. The undegraded identifier may be amplified using primers that hybridize to each end of the undegraded identifier and therefore do not hybridize to each end of the degraded or cleaved identifier.

[0134] Figure 17B illustrates an exemplary method for using polymerase chain reaction to perform an "OR" or "AND" operation to access identifiers containing multiple components. In one example, if two forward primers bind distinct sets of identifiers on the left end, "OR" amplification of the union of these sets of identifiers may be achieved by using the two forward primers together in a multiplex PCR reaction with a reverse primer that binds to all of the identifiers on the right end. In another example, if one forward primer binds to a set of identifiers on the left end and one reverse primer binds to a set of identifiers on the right end, "AND" amplification of the intersection of those two sets of identifiers may be achieved by using the forward and reverse primers together as a primer pair in a PCR reaction.

[0135] Figure 17C illustrates an example method for using affinity tags to perform an "OR" or "AND" operation to access identifiers containing multiple components. In one example, if affinity probe "P1" captures all identifiers with component "C1" and another affinity probe "P2" captures all identifiers with component "C2," the set of all identifiers with C1 or C2 can be captured by using P1 and P2 simultaneously (corresponding to an "OR" operation). In another example, with the same components and probes, the set of all identifiers with C1 and C2 can be captured by using P1 and P2 sequentially (corresponding to an "AND" operation).

[0136] Method for reading information stored in a nucleic acid sequence In another aspect, the present disclosure provides a method for reading information encoded in a nucleic acid sequence. The method for reading information encoded in a nucleic acid sequence may include (a) providing an identifier library, (b) identifying identifiers present in the identifier library, (c) generating a string of symbols from the identifiers present in the identifier library, and (d) compiling information from the string of symbols. The identifier library may include a subset of a plurality of identifiers from a combinatorial space. Each individual identifier in the subset of identifiers may correspond to an individual symbol in the string of symbols. The identifier may include one or more components. The components may include a nucleic acid sequence.

[0137] Information may be written to one or more identifier libraries as described elsewhere herein. Identifiers may be constructed using any of the methods described elsewhere herein. Stored data may be copied and accessed using any of the methods described elsewhere herein.

[0138] The identifier may include information related to the location of the encoded symbol, the value of the encoded symbol, or both the location and value of the encoded symbol. The identifier may include information related to the location of the encoded symbol, and the presence or absence of the identifier in the identifier library may indicate the value of the symbol. The presence of the identifier in the identifier library may indicate a first symbol value (e.g., a first bit value) in the binary string, and the absence of the identifier in the identifier library may indicate a second symbol value (e.g., a second bit value) in the binary string. In a binary system, basing the bit value on the presence or absence of the identifier in the identifier library may reduce the number of assembled identifiers and therefore reduce write time. In one example, the presence of the identifier may indicate a bit value of "1" in the mapped location, and the absence of the identifier may indicate a bit value of "0" in the mapped location.

[0139] Generating a symbol (e.g., bit value) for a piece of information may include identifying the presence or absence of an identifier to which the symbol (e.g., bit) may be mapped or encoded. Determining the presence or absence of the identifier may include sequencing the identifier or detecting the presence of the identifier using a hybridization array. In one example, decoding and reading the encoded sequence may be performed using a sequencing platform. Examples of sequencing platforms are described in U.S. Patent Application No. 14 / 465,685, filed August 21, 2014; U.S. Patent Application No. 13 / 886,234, filed May 2, 2013; and U.S. Patent Application No. 12 / 400,593, filed March 9, 2009, each of which is incorporated herein by reference in its entirety.

[0140] In one example, decoding nucleic acid-encoded data may be accomplished by base-by-base sequencing of nucleic acid strands, such as Illumina® Sequencing, or by utilizing sequencing techniques that indicate the presence or absence of unique nucleic acid sequences, such as capillary electrophoretic fragmentation analysis. Sequencing may employ the use of reversible terminators. Sequencing may employ the use of natural or unnatural (e.g., artificial) nucleotides or nucleotide analogs. Alternatively, or in addition, decoding nucleic acid sequences may be performed using a variety of analytical techniques, including, but not limited to, any method that generates an optical, electrochemical, or chemical signal. A variety of sequencing techniques may be used, including but not limited to polymerase chain reaction (PCR), digital PCR, Sanger sequencing, high-throughput sequencing, sequencing-by-synthesis, single molecule sequencing, sequencing-by-ligation, RNA-Seq (Illumina), next-generation sequencing, Digital Gene Expression (Helicos), Clonal Single MicroArray (Solexa), shotgun sequencing, Maxim-Gilbert sequencing, or massively parallel sequencing.

[0141] A variety of readout methods can be used to extract information from the encoded nucleic acids. In one example, microarrays (or any type of fluorescent hybridization), digital PCR, quantitative PCR (qPCR), and various sequencing platforms can further be used to read out the encoded sequence and, by extension, the digitally encoded data.

[0142] The identifier library may further include complementary nucleic acid sequences that provide metadata about the information, encrypt or mask the information, or both provide metadata and mask the information. The complementary nucleic acids may be identified simultaneously with identifying the identifier. Alternatively, the complementary nucleic acids may be identified before or after identifying the identifier. In one example, the complementary nucleic acids are not identified during reading of the encoded information. The complementary nucleic acid sequences may be indistinguishable from the identifier. An identifier index or key may be used to distinguish the complementary nucleic acid molecules from the identifier.

[0143] The efficiency of encoding and decoding data may be increased by reordering input bit strings to allow for the use of fewer nucleic acid molecules. For example, if an input string is received with a high occurrence of a "111" substring, which may map to three nucleic acid molecules (e.g., an identifier) ​​with an encoding method, this input string may be reordered to a "000" substring, which may map to a null set of nucleic acid molecules. An alternative input substring for "000" may also be reordered to "111." This reordering method may reduce the total amount of nucleic acid molecules used to encode the data, since there may be a reduction in the number of "1"s in the dataset. In this example, the overall size of the dataset may be increased to accommodate a codebook that specifies new mapping instructions. An alternative method for increasing the efficiency of encoding and decoding is to reorder input strings to reduce their variable length. For example, "111" may be reordered to "00," which may reduce the size of the dataset and reduce the number of "1"s in the dataset.

[0144] The speed and efficiency of decoding data-encoded nucleic acids can be controlled (e.g., increased) by specifically designing the identifier for ease of detection. For example, a nucleic acid sequence (e.g., identifier) ​​designed for ease of detection can include a nucleic acid sequence containing a majority of nucleotides that are easier to call and detect based on optical, electrochemical, chemical, or physical properties. Artificial nucleic acid sequences can be either single-stranded or double-stranded. Artificial nucleic acid sequences can include synthetic or non-natural nucleotides that improve the detectable properties of the nucleic acid sequence. Artificial nucleic acid sequences can include all natural nucleotides, all synthetic or non-natural nucleotides, or a combination of natural, synthetic, and non-natural nucleotides. Synthetic nucleotides can include nucleotide analogs such as peptide nucleic acids, locked nucleic acids, glycol nucleic acids, and threose nucleic acids. Non-natural nucleotides may include dNaM, an artificial nucleoside containing a 3-methoxy-2-naphthly group, and d5SICS, an artificial nucleoside containing a 6-methylisoquinoline-1-thion-2-yl group. Artificial nucleic acid sequences may be designed for a single enhanced property, such as enhanced optical properties, or designed nucleic acid sequences may be designed with multiple enhanced properties, such as enhanced optical and electrochemical properties or enhanced optical and chemical properties.

[0145] Artificial nucleic acid sequences may contain reactive natural nucleotides, synthetic nucleotides, and non-natural nucleotides that do not improve the optical, electrochemical, chemical, or physical properties of the nucleic acid sequence. The reactive components of the nucleic acid sequence may allow for the addition of chemical moieties to the nucleic acid sequence that impart improved properties. Each nucleic acid sequence may contain a single chemical moiety or multiple chemical moieties. Exemplary chemical moieties may include, but are not limited to, fluorescent moieties, chemiluminescent moieties, acidic or basic moieties, hydrophobic or hydrophilic moieties, and moieties that alter the oxidation state or reactivity of the nucleic acid sequence.

[0146] Sequencing platforms may be specifically designed for decoding and reading information encoded into nucleic acid sequences. Sequencing platforms may be dedicated to sequencing single-stranded or double-stranded nucleic acid molecules. Sequencing platforms may decode data-encoded nucleic acids by reading individual bases (e.g., base-by-base sequencing) or by detecting the presence or absence of entire nucleic acid sequences (e.g., components) incorporated within nucleic acid molecules (e.g., identifiers). Sequencing platforms may include the use of promiscuous reagents, increased read lengths, and the addition of detectable chemical moieties to detect unique nucleic acid sequences. The use of more promiscuous reagents during sequencing may increase read efficiency by enabling faster base calling, thereby reducing sequencing time. The use of increased read lengths may allow longer sequences of encoded nucleic acids to be decoded per read. The addition of detectable chemical moiety tags may allow the detection of the presence or absence of a nucleic acid sequence by the presence or absence of the chemical moiety. For example, each nucleic acid sequence encoding a bit of information may be tagged with a chemical moiety that generates a unique optical, electrochemical, or chemical signal. The presence or absence of the unique optical, electrochemical, or chemical signal may indicate a bit value of "0" or "1." The nucleic acid sequence may contain a single chemical moiety or multiple chemical moieties. The chemical moiety may be added to the nucleic acid sequence prior to using the nucleic acid sequence to encode data. Alternatively, or in addition, the chemical moiety may be added to the nucleic acid sequence after encoding the data but before decoding the data. The chemical moiety tag may be added directly to the nucleic acid sequence, or the nucleic acid sequence may include a synthetic or non-natural nucleotide anchor and the chemical moiety tag may be added to the anchor.

[0147] Unique codes may be applied to minimize or detect encoding and decoding errors. Encoding and decoding errors may arise from false negatives (e.g., nucleic acid molecules or identifiers not included in random sampling). One example of an error detection code may be a checksum sequence that counts the number of identifiers in a contiguous set of possible identifiers included in an identifier library. While reading the identifier library, the checksum may indicate how many identifiers from that contiguous set of identifiers are expected to be retrieved, and identifiers may continue to be sampled for reading until the expected number is met. In some embodiments, a checksum sequence may be included for every contiguous set of R identifiers, where R may be equal to or greater than 1, 2, 5, 10, 50, 100, 200, 500, or 1000 in size, or may be less than 1000, 500, 200, 100, 50, 10, 5, or 2. Smaller values ​​of R improve error detection. In some embodiments, the checksum may be a complementary nucleic acid sequence. For example, a set containing seven nucleic acid sequences (e.g., components) may be divided into two groups: nucleic acid sequences for constructing an identifier using a product scheme (components X1-X3 in layer X and Y1-Y3 in layer Y), and nucleic acid sequences for complementary checksums (X4-X7 and Y4-Y7). Checksum sequences X4-X7 may indicate whether zero, one, two, or three sequences from layer X are assembled with each component from layer Y. Alternatively, checksum sequences Y4-Y7 may indicate whether zero, one, two, or three sequences from layer Y are assembled with each component from layer X. In this example, the original identifier library with identifiers {X1Y1, X1Y3, X2Y1, X2Y2, X2Y3} may be supplemented to include checksums to become the following pool: {X1Y1, X1Y3, X2Y1, X2Y2, X2Y3, X1Y6, X2Y7, X3Y4, X6Y1, X5Y2, X6Y3}. The checksum array may also be used for error correction.For example, the absence of X1Y1 from the above dataset and the presence of X1Y6 and X6Y1 may allow interference that the X1Y1 nucleic acid molecule is missing from the dataset. The checksum sequence may indicate whether the identifier is missing from the sampled or accessed portion of the identifier library. In the case of a missing checksum sequence, an access method such as PCR or affinity tag probe hybridization may amplify and / or isolate it. In some embodiments, the checksum may not be a complementary nucleic acid sequence. The checksum may be directly encoded into the information as represented by the identifier.

[0148] Noise in data encoding and decoding may be reduced by constructing identifiers in a palindrome, for example, by using palindrome pairs of components rather than single components in a product scheme. Pairs of components from different layers may then be assembled together in a palindrome fashion (e.g., YXY instead of XY for components X and Y). This palindrome method may be extended to a larger number of layers (e.g., ZYXYZ instead of XYZ) and may allow for the detection of spurious cross-reactivity between identifiers.

[0149] Adding an excess (e.g., a very large excess) of complementary nucleic acid sequences to the identifier may prevent sequencing from recovering the encoded identifier. Before decoding the information, the identifier may be enriched from the complementary nucleic acid sequences. For example, the identifier may be enriched by a nucleic acid amplification reaction using primers that are unique to the identifier end. Alternatively, or in addition, the information may be decoded without enriching the sample pool by sequencing (e.g., sequencing-by-synthesis) using unique primers. With both decoding methods, it may be difficult to enrich or decode the information without having the decoding key or knowing something about the composition of the identifier. Alternative access methods, such as using affinity tag-based probes, may also be used.

[0150] System for encoding binary array data Systems for encoding digital information into nucleic acids (e.g., DNA) can include systems, methods, and devices for converting files and data (e.g., raw data, compressed zip files, integer data, and other forms of data) into bytes and encoding the bytes into nucleic acids, typically segments or sequences of DNA, or combinations thereof.

[0151] In one aspect, the present disclosure provides a system for encoding binary sequence data using nucleic acids. The system for encoding binary sequence data using nucleic acids may include a device and one or more computer processors. The device may be configured to construct an identifier library. The one or more computer processors may be individually or collectively programmed to (i) translate information into a string of symbols, (ii) map the string of symbols to a plurality of identifiers, and (iii) construct an identifier library including at least a subset of the plurality of identifiers. Each identifier of the plurality of identifiers may correspond to each symbol of the string of symbols. Each identifier of the plurality of identifiers may include one or more components. Each component of the one or more components may include a nucleic acid sequence.

[0152] In another aspect, the present disclosure provides a system for reading binary sequence data using nucleic acids. The system for reading binary sequence data using nucleic acids may include a database and one or more computer processors. The database may store an identifier library encoding information. The one or more computer processors may be individually or collectively programmed to (i) identify identifiers in the identifier library, (ii) generate a plurality of symbols from the identifiers identified in (i), and (iii) compile information from the plurality of symbols. The identifier library may include a subset of the plurality of identifiers. Each individual identifier of the plurality of identifiers may correspond to an individual symbol in the string of symbols. The identifier may include one or more components. The components may include nucleic acid sequences.

[0153] A non-limiting embodiment of a method for encoding digital data using the system can include receiving digital information in the form of a byte stream. Parsing the byte stream into individual bytes, mapping bit locations within the bytes using a nucleic acid index (or identifier rank), and encoding sequences corresponding to either a bit value of 1 or a bit value of 0 into identifiers. Retrieving the digital data can include sequencing a nucleic acid sample or pool containing sequences of nucleic acids (e.g., identifiers) that map to one or more bits, referencing the identifier rank to determine whether the identifier is present in the nucleic acid pool, and decoding the location and bit value information for each sequence into bytes containing the sequence of digital information.

[0154] A system for encoding, writing, copying, accessing, reading, and decoding information encoded and written into nucleic acid molecules may be a single integrated unit or may be multiple units configured to perform one or more of the above-mentioned operations. A system for encoding and writing information into nucleic acid molecules (e.g., identifiers) may include a device and one or more computer processors. The one or more computer processors may be programmed to parse the information into a string of symbols (e.g., a string of bits). The computer processor may generate an identifier rank. The computer processor may categorize the symbols into two or more categories. One category may include symbols that will be represented by the presence of a corresponding identifier in the identifier library, and the other category may include symbols that will be represented by the absence of a corresponding identifier in the identifier library. The computer processor may instruct the device to assemble an identifier corresponding to the symbol that will be represented by the presence of the identifier in the identifier library.

[0155] The device may include multiple regions, sections, or partitions. Reagents and components for assembling the identifier may be stored in one or more regions, sections, or partitions of the device. Layers may be stored in separate regions of a section of the device. A layer may contain one or more unique components. Components in one layer may be unique from components in another layer. A region or section may include a container, and a partition may include a well. Each layer may be stored in a separate container or partition. Each reagent or nucleic acid sequence may be stored in a separate container or partition. Alternatively, or in addition, reagents may be combined to form a master mix for the identifier structure. The device may transport reagents, components, and templates from one section of the device to be combined in another section. The device may provide conditions for completing the assembly reaction. For example, the device may provide heating, agitation, and detection of reaction progress. The constructed identifier may be directed to undergo one or more subsequent reactions to add a barcode, a common sequence, a variable sequence, or a tag to one or more ends of the identifier. The identifiers may then be directed to regions or partitions to generate an identifier library. One or more identifier libraries may be stored within each region, section, or individual partition of the device. The device may use pressure, vacuum, or suction to transport fluids (e.g., reagents, components, templates).

[0156] The identifier library may be stored within the device or transferred to a separate database. The database may contain one or more identifier libraries. The database may provide conditions for long-term storage of the identifier library (e.g., conditions that reduce degradation of the identifiers). The identifier library may be stored in powder, liquid, or solid format. The database may provide ultraviolet light protection, reduced temperature (e.g., refrigeration or freezing), and protection from degrading chemicals and enzymes. Prior to transfer to the database, the identifier library may be lyophilized or frozen. The identifier library may include ethylenediaminetetraacetic acid (EDTA) to inactivate nucleases and / or buffers to maintain the stability of the nucleic acid molecules.

[0157] The database may be coupled to, include, or separate from a device that writes information to the identifiers, copies the information, accesses the information, or reads the information. A portion of the identifier library may be removed from the database before copying, accessing, or reading. The device that copies information from the database may be the same device as the device that writes the information, or a different device. The device that copies the information may extract an aliquot of the identifier library from the device and combine the aliquot with reagents and components to amplify a portion or the entire identifier library. The device may control the temperature, pressure, and agitation of the amplification reaction. The device may include a partition, and one or more amplification reactions may occur within the partition containing the identifier library. The device may copy more than one pool of identifiers at a time.

[0158] The copied identifiers may be transported from the copy device to an access device. The access device may be the same device as the copy device. The access device may include separate regions, sections, or partitions. The access device may have one or more columns, bead reservoirs, or magnetic regions for separating the identifiers bound to the affinity tags. Alternatively, or in addition, the access device may have one or more size selection units. The size selection unit may include agarose gel electrophoresis or any other method for size selecting nucleic acid molecules. The copying and extraction may be performed in the same region of the device or in different regions of the device.

[0159] The accessed data may be read within the same device, or the accessed data may be transferred to another device. The reading device may include a detection unit to detect and identify the identifier. The detection unit may be part of a sequencer, a hybridization array, or other unit for identifying the presence or absence of an identifier. The sequencing platform may be specifically designed for decoding and reading information encoded into a nucleic acid sequence. The sequencing platform may be dedicated to sequencing single-stranded or double-stranded nucleic acid molecules. The sequencing platform may decode data-encoded nucleic acids by reading individual bases (e.g., base-by-base sequencing) or by detecting the presence or absence of an entire nucleic acid sequence (e.g., component) incorporated within the nucleic acid molecule (e.g., identifier). Alternatively, the sequencing platform may be a system such as Illumina® Sequencing or capillary electrophoretic fragmentation analysis. Alternatively, or in addition, decoding the nucleic acid sequence may be performed using a variety of analytical techniques implemented by the device, including, but not limited to, any method that generates an optical, electrochemical, or chemical signal.

[0160] Information storage in nucleic acid molecules may have various applications, including, but not limited to, long-term information storage, confidential information storage, and medical information storage. In one example, a person's medical information (e.g., medical history and records) may be stored in a nucleic acid molecule and carried by the person. The information may be stored externally (e.g., in a wearable device) or internally (e.g., in a subcutaneous capsule). When a patient is brought to a clinic or hospital, a sample may be taken from the device or capsule, and the information may be decoded using a nucleic acid sequencer. Personal storage of medical records in nucleic acid molecules may provide an alternative to computer and cloud-based storage systems. Personal storage of medical records in nucleic acid molecules may reduce the incidence or prevalence of medical record hacking. Nucleic acid molecules used in capsule-based storage of medical records may be derived from human genome sequences. The use of human genome sequences may reduce the immunogenicity of nucleic acid sequences in the event of capsule damage and leakage.

[0161] Computer Systems The present disclosure provides computer systems programmed to implement the methods of the present disclosure. Figure 19 shows a computer system 1901 programmed or otherwise configured to encode digital information into a nucleic acid sequence and / or read (e.g., decode) information derived from a nucleic acid sequence. The computer system 1901 can adjust various aspects of the encoding and decoding procedures of the present disclosure, such as, for example, bit value and bit location information for a given bit or byte from an encoded bitstream or bytestream.

[0162] The computer system 1901 includes a central processing unit (CPU, also referred to herein as "processor" and "computer processor") 1905, which may be a single-core processor or a multi-core processor, or multiple processors for parallel processing. The computer system 1901 also includes memory or memory locations 1910 (e.g., random access memory, read-only memory, flash memory), an electronic storage unit 1915 (e.g., a hard disk), a communication interface 1920 (e.g., a network adapter) for communicating with one or more other systems, and peripheral devices 1925, such as cache, other memory, data storage, and / or electronic display adapters. The memory 1910, the storage unit 1915, the interface 1920, and the peripheral devices 1925 communicate with the CPU 1905 through a communication bus (solid lines), such as a motherboard. The storage unit 1915 may be a data storage unit (or data repository) for storing data. Computer system 1901 can be operably coupled to a computer network (“network”) 1930 using communication interface 1920. Network 1930 can be the Internet, an Internet and / or extranet, or an intranet and / or extranet in communication with the Internet. Network 1930, in some cases, is a telecommunications and / or data network. Network 1930 can include one or more computer servers, which can enable distributed computing such as cloud computing. Network 1930, in some cases with computer system 1901, can implement a peer-to-peer network, which may enable devices coupled to computer system 1901 to act as clients or servers.

[0163] The CPU 1905 can execute an array of machine-readable instructions, which may be embodied in a program or software. The instructions may be stored in a memory location, such as the memory 1910. The instructions may be directed to the CPU 1905, which can then program or otherwise configure the CPU 1905 to implement the methods of the present disclosure. Examples of operations performed by the CPU 1905 can include fetch, decode, execute, and writeback.

[0164] The CPU 1905 can be part of a circuit, such as an integrated circuit. One or more other components of the system 1901 can be included in the circuit. In some cases, the circuit is an application specific integrated circuit (ASIC).

[0165] The storage unit 1915 can store files such as drivers, libraries, and saved programs. The storage unit 1915 can store user data, for example, user preferences and user programs. The computer system 1901 in some cases can include one or more additional data storage units external to the computer system 1901, such as located on a remote server that communicates with the computer system 1901 through an intranet or the Internet.

[0166] Computer system 1901 can communicate with one or more remote computer systems through network 1930. For example, computer system 1901 can communicate with a user's remote computer system or other devices and / or machinery (e.g., a sequencer or other system for chemically determining the order of nitrogenous bases in a nucleic acid sequence) that may be used by the user in analyzing encoded or decoded data in a nucleic acid sequence. Examples of remote computer systems include personal computers (e.g., portable PCs), slate or tablet PCs (e.g., Apple® iPad®, Samsung® Galaxy Tab), telephones, smartphones (e.g., Apple® iPhone®, Android-enabled devices, Blackberry®), or personal digital assistants. A user can access computer system 1901 via network 1930.

[0167] The methods described herein may be implemented by machine (e.g., computer processor) executable code stored on an electronic storage location of the computer system 1901, such as, for example, on the memory 1910 or the electronic storage unit 1915. The machine-executable or machine-readable code may be provided in the form of software. During use, the code is executable by the processor 1905. In some cases, the code may be retrieved from the storage unit 1915 and stored on the memory 1910 for ready access by the processor 1905. In some situations, the electronic storage unit 1915 may be eliminated, and the machine-executable instructions may be stored on the memory 1910.

[0168] The code may be pre-compiled and configurable for use with a machine having a processor adapted to execute the code, or it may be compilable at run-time. The code may be provided in a programming language that is selectable to allow the code to be executed in a pre-compiled or as-compiled manner.

[0169] Aspects of the systems and methods provided herein, such as computer system 1901, can be embodied in programming. Various aspects of the technology may be considered a “product” or “article of manufacture” in the form of machine (or processor) executable code and / or associated data, typically carried or embodied in some type of machine-readable medium. The machine-executable code can be stored on an electronic storage unit, such as memory (e.g., read-only memory, random-access memory, flash memory) or a hard disk. “Storage”-type media may include any or all of a computer’s tangible memory, processor, etc., or its associated modules, such as various semiconductor memories, tape drives, disk drives, etc., that may provide non-transitory storage at any time for software programming. All or portions of the software may, from time to time, be communicated over the Internet or various other telecommunications networks. Such communication may enable, for example, loading of the software from one computer or processor to another, for example, from an administrative server or host computer to an application server computer platform. Thus, other types of media that may carry software elements include optical, electric, and electromagnetic waves, such as those used across physical interfaces between local devices, through wired and optical terrestrial networks, and on various air links. Physical elements that carry such waves, such as wired or wireless links, optical links, etc., may also be considered software-bearing media. As used herein, unless limited to non-transitory, tangible "storage" media, terms such as computer or machine "readable medium" refer to any medium that participates in providing instructions to a processor for execution.

[0170] Thus, a machine-readable medium such as a computer-executable code may take many forms, including, but not limited to, a tangible storage medium, a carrier wave medium, or a physical transmission medium. Non-volatile storage media include optical or magnetic disks, such as any of the storage devices within any computer, such as may be used to implement the databases, etc., shown in the figures. Volatile storage media include dynamic memory, such as the main memory of such a computer platform. Tangible transmission media include coaxial cables, copper wire, and fiber optics, including the wires that comprise a bus within a computer system. Carrier-wave transmission media may take the form of electric or electromagnetic signals, or acoustic or light waves, such as those generated during radio frequency (RF) and infrared (IR) data communications. Thus, common forms of computer readable media include, for example, a floppy disk, a flexible disk, a hard disk, magnetic tape, any other magnetic medium, a CD-ROM, a DVD or DVD-ROM, any other optical medium, punched card paper tape, any other physical storage medium with a pattern of holes, a RAM, a ROM, a PROM and EPROM, a FLASH-EPROM, any other memory chip or cartridge, a carrier wave transporting data or instructions, a cable or link transporting such a carrier wave, or any other medium from which a computer can read programming code and / or data. Many of these forms of computer readable media may be involved in carrying one or more sequences of one or more instructions to a processor for execution.

[0171] The computer system 1901 can include or communicate with an electronic display 1935 that includes a user interface (UI) 1940 for providing sequence output data including, for example, chromatographs, sequences, and bit, byte, or bitstreams encoded by or read by a machine or computer system encoding or decoding nucleic acids, raw data, files, and compressed or unzipped zip files into which DNA is encoded or decoded. Examples of UIs include, but are not limited to, graphical user interfaces (GUIs) and web-based user interfaces. The methods and systems of the present disclosure can be implemented by one or more algorithms. The algorithms can be implemented by software when executed by the central processing unit 1905. The algorithms can be used, for example, with DNA indexes and raw data or zip-file compressed or decompressed data to determine a customized method for coding digital information from the raw data or zip-file compressed data prior to encoding the digital information. [Example]

[0172] Example 1 Encoding, writing, and reading a single poem within a DNA molecule The data to be encoded is a text file containing a poem. The data is manually encoded using a pipette to mix together DNA components from two layers of 96 components to construct an identifier using a product method implemented with overlap extension PCR. The first layer, X, contains 96 overall DNA components. The second layer, Y, also contains 96 overall components. Before writing the DNA, the data is mapped to binary and then recorded into a uniform weight format in which every consecutive (adjacent disjoint) string of 61 bits of the original data is translated into a 96-bit string with exactly 17 bits of 1. This uniform weight format may have inherent error-checking qualities. The data is then hashed into a 96 x 96 table to form a reference map.

[0173] The center panel of Figure 18A illustrates a two-dimensional reference map of a 96x96 table that encodes the poem into multiple identifiers. Dark dots correspond to "1" bit values ​​and white dots correspond to "0" bit values. The data is encoded into identifiers using two layers of 96 components. Each X and Y value in the table is assigned to a component, and the X and Y components are assembled into identifiers using overlap extension PCR for each (X,Y) coordinate with a "1" value. The data was read back (e.g., decoded) by sequencing the identifier library to determine the presence or absence of each possible (X,Y) assembly.

[0174] The right panel of Figure 18A illustrates a two-dimensional heat map of the abundance of sequences present in the identifier library as determined by sequencing. Each pixel represents a molecule containing the corresponding X and Y components, and the grayscale intensity at that pixel represents the relative abundance of that molecule compared to other molecules. Identifiers are considered as the top 17 most abundant (X,Y) assemblies in each row (since uniform weight encoding ensures that each consecutive string of 96 bits can have exactly 17 "1" values ​​and therefore 17 corresponding identifiers).

[0175] Example 2 62824-bit text file encoding The data to be encoded are three poems of text files totaling 62,824 bits. The data is encoded using a Labcyte Echo® liquid processing device to mix together DNA components from two layers of 384 components to construct identifiers using a production method implemented with overlap extension PCR. The first layer, X, contains 384 overall DNA components. The second layer, Y, also contains 384 overall components. Before writing the DNA, the data is mapped to binary, then reduced in weight (the number of "1" bit values) and recoded to include a checksum. The checksum is established so that for every consecutive string of 192 bits of data, there is an identifier corresponding to the checksum. The recoded data has a weight of approximately 10,100, which corresponds to the number of identifiers to be constructed. The data may then be hashed into a 384 x 384 table to form a reference map.

[0176] The center panel of Figure 18B illustrates a two-dimensional reference map of a 384 x 384 table that encodes a text file into multiple identifiers. Each coordinate (X, Y) corresponds to a bit of data at location X + (Y - 1) * 192. Black dots correspond to a bit value of "1" and white dots correspond to a bit value of "0." The black dots on the right side of the figure are checksums, and the pattern of black dots at the top of the figure is a codebook (e.g., a dictionary for decoding the data). Each X and Y value in the table can be assigned to a component, and the X and Y components are assembled into an identifier using overlap extension PCR for each (X, Y) coordinate with a "1" value. The data was read back (e.g., decoded) by sequencing the identifier library to determine the presence or absence of each possible (X, Y) assembly.

[0177] The right panel of Figure 18B illustrates a two-dimensional heat map of the abundance of sequences present in the identifier library as determined by sequencing. Each pixel represents a molecule containing the corresponding X and Y components, and the grayscale intensity at that pixel represents the relative abundance of that molecule compared to other molecules. The identifiers are considered to be the top S most abundant (X,Y) assemblies in each row, and S for each row may be a checksum value.

[0178] While preferred embodiments of the present invention have been illustrated and described herein, it will be apparent to those skilled in the art that such embodiments are provided by way of example only. It is not intended that the present invention be limited by the specific examples provided herein. While the present invention has been described with reference to the foregoing specification, the description and illustration of the embodiments herein are not meant to be construed in a limiting sense. Numerous variations, changes, and substitutions will occur to those skilled in the art without departing from the present invention. Moreover, it is to be understood that all aspects of the present invention are not limited to the specific depictions, configurations, or relative proportions set forth herein, which depend upon a variety of conditions and variables. It should be understood that various alternatives to the embodiments of the present invention described herein may be employed in practicing the present invention. It is therefore contemplated that the present invention shall encompass any such alternatives, modifications, variations, or equivalents. It is intended that the following claims define the scope of the invention, and that methods and structures within the scope of these claims and their equivalents be covered thereby.

Claims

1. 1. A method for writing information into a nucleic acid sequence, the method comprising: (a) constructing a plurality of components, each individual component of the plurality of components comprising a nucleic acid sequence; (b) iteratively ligating two or more components of the plurality of components together, thereby generating a plurality of identifiers, each identifier of the plurality of identifiers including two or more components, each identifier of the plurality of identifiers corresponding to a respective symbol, the symbol corresponding to at least a portion of the information; and (c) selectively capturing or amplifying an identifier library comprising at least a subset of the plurality of identifiers, each identifier of the subset of the plurality of identifiers comprising a barcode that identifies the identifier library; A method comprising:

2. The method of claim 1 , wherein the individual symbols are one of one or more possible symbol values.

3. The method of claim 1 , wherein the individual symbols are one of two possible symbol values.

4. The method of claim 1 , wherein a symbol value is represented by the absence of a distinct identifier in the identifier library.

5. 4. The method of claim 3, wherein the two possible symbol values ​​are bit values ​​of 0 and 1, and the individual symbols with the bit value of 0 are represented by the absence of a distinct identifier in the identifier library and the individual symbols with the bit value of 1 are represented by the presence of the distinct identifier in the identifier library, and vice versa.

6. 2. The method of claim 1 , wherein generating the individual identifiers in the identifier library comprises ligating the two or more components from two or more layers, each layer of the two or more layers comprising a separate set of components.

7. The method of claim 6 , wherein the individual identifiers from the identifier library include one component from each layer of the two or more layers.

8. The method of claim 7 , wherein the two or more components are assembled in a fixed order.

9. The method of claim 7 , wherein the two or more components are assembled in any order.

10. The method of claim 7 , wherein the two or more components are assembled with one or more partition components installed between two components from different ones of the two or more layers.

11. The method of claim 6 , wherein the individual identifiers include one component from each layer of the subset of two or more layers.

12. The method of claim 6 , wherein the individual identifiers include at least one component from each of the two or more layers.

13. 2. The method of claim 1, wherein the two or more components are ligated using sticky end ligation, BioBrick assembly, Golden Gate assembly, Gibson assembly, ligase cycling reaction, or template-directed ligation.

14. 2. The method of claim 1, wherein generating the individual identifiers in the identifier library comprises deleting, exchanging, or inserting at least one component or portion thereof in a parent identifier by contacting the parent identifier with a reagent comprising at least one recombinase or nuclease.

15. 15. The method of claim 14, wherein the parent identifier comprises nuclease specific target sites, recombinase recognition sites, or multiple components flanked by separate spacer sequences.

16. 15. The method of claim 14, wherein the nuclease is selected from the group consisting of Clustered Regularly Interspaced Short Palindromic Repeats (CRISPR) Cas9, Transcription activator-like effector nucleases (TALENs), zinc finger nucleases, and any combination thereof.

17. The method of claim 1 , wherein the nucleic acid sequence stores metadata of the information or hides the information.

18. 20. The method of claim 17, wherein the metadata includes secondary information corresponding to the source of the information, the intended recipient of the information, the original format of the information, the equipment and methods used to encode the information, the date and time of writing the information to the identifier library, modifications made to the information, and / or references to other information.

19. The method of claim 1 , wherein two or more identifier libraries are combined.

20. The method of claim 1, wherein the subset includes multiple identifiers, each identifier corresponding to a symbol having the same value.

21. The method of claim 1 , wherein the plurality of identifiers are selected for a read operation, a write operation, an access operation, a copy operation, and a delete operation.

22. The method of claim 1 further comprising error checking or detection of the individual symbols.

23. 23. The method of claim 22, wherein the error checking or detection comprises a checksum.

24. The method of claim 1 , wherein the information is copied by making one or more copies of the identifier library.

25. The method of claim 1 , wherein the information is queried by isolating a targeted subset of identifiers from the identifier library.

26. The method of claim 1 , wherein the information is read by determining the nucleic acid sequences of a plurality of identifiers from the identifier library.

27. The method of claim 1 , wherein the barcode stores metadata about the information or hides the information.

Citation Information

Patent Citations

  • Nucleic acid-based encryption and decryption methods

    JP2015525560A

  • High-capacity storage of digital information in DNA

    JP2015529864A

  • Information storage methods using nucleic acids

    JP2015533077A

  • The use of nucleotide sequences as carrier of information

    WO2004009844A1