DNA Data Storage Using Complex Fragments
By employing composite DNA fragments with diverse base sequences and advanced decoding algorithms, the method addresses high error rates in DNA data storage, enhancing efficiency and accuracy while reducing costs and synthesis time.
Patent Information
- Application Number
- JP2024525608
- Authority / Receiving Office
- JP · JP
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2021-11-23
- Filing Date
- 2022-11-16
- Publication Date
- 2024-11-13
AI Technical Summary
Current DNA data storage methods suffer from high error rates during writing and reading, which are difficult to correct due to insertion and deletion errors, and the process is inefficient compared to traditional digital systems.
The use of composite fragments, each with a different base sequence, is employed to encode information, along with error-detection codes to authenticate data, and decoding algorithms to ensure accurate reading and writing.
This approach significantly improves the efficiency and accuracy of DNA data storage by increasing the number of bits per synthesis cycle, reducing readout costs, and enhancing error correction capabilities, achieving a 3-fold improvement in speed and 2-fold reduction in cost compared to traditional methods.
Smart Images

Figure 2024542016000001_ABST
Abstract
Description
[Technical field]
[0001] The present invention relates generally to DNA data storage, and more particularly to a method and system for DNA data storage using composite fragments. [Background technology]
[0002] The digital universe could add around 175 zettabytes of data per year by 2025. That's 175 followed by 21 zeros. To keep up with that amount of information would require massive data centers and vast energy resources. Researchers are backing DNA as a sustainable and stable alternative.
[0003] When most people think of DNA, they think of life, not computers. However, DNA itself is a four-letter code for conveying information about living things. A DNA molecule is made up of four types of bases or nucleotides, each identified by a letter: adenine (A), thymine (T), guanine (G), and cytosine (C). These are the basis of all DNA code and provide the instruction manual for building all living things on Earth.
[0004] DNA synthesis, a fairly well-understood technique, is widely used in medicine, pharmaceuticals, and biofuel development, to name just a few applications. The technique organizes bases into various configurations, indicated by specific sequences of A, C, G, and T. These bases wrap around each other in a twisted chain (the familiar double helix) to form molecules. By arranging these letters in sequences, a code is created that tells an organism how to build.
[0005] A complete set of DNA molecules constitutes the genome, i.e. the blueprint of a person's body. By synthesizing DNA molecules, i.e. making them from scratch, researchers found that they could specify or write long strings of the letters A, C, G, T, and then read back these sequences. This process is similar to how computers store binary information. As such, this process was a short conceptual step towards encoding binary computer files into molecules.
[0006] While this method has been shown to work, currently reading and writing DNA-encoded files is slow. It takes about one second to add one base to DNA. Writing an archive file at this speed could take decades, but faster methods, including massively parallel operations that write to many molecules at once, are being developed in research.
[0007] The ADS Codex shows exactly how to convert 0's and 1's into a sequence of the four letter combinations A, C, G, and T. The Codex also handles the decoding back to binary. DNA can be synthesized in a number of ways, and the ADS Codex can accommodate all of these methods.
[0008] Unfortunately, compared to traditional digital systems, the error rate during writing to molecular storage by DNA synthesis is much higher. These errors come from a different source than in the digital world and are therefore more difficult to correct. In digital hard disks, binary errors occur when a 0 flips to a 1 or a 1 flips to a 0. In DNA, problems arise from insertion and deletion errors. For example, a user may write ACGT but try to write A and nothing appears, so the alignment of the letters shifts to the left, or type AAA.
[0009] Normal error-correcting codes don't work well for this kind of problem, so ADS Codex adds error-detection code that authenticates the data. When the software converts the data back to binary, it tests to make sure the code matches. If it doesn't match, it removes or adds bases, or letters, until authentication is successful. However, the problem still remains.
[0010] Therefore, more efficient methods for DNA data storage are needed. Summary of the Invention
[0011] According to one aspect of the invention, there is provided a computer-implemented method for storing information in a polynucleotide, the method including using a plurality of types of nucleotide fragments, each of the nucleotide fragments having a different base sequence, constructing a plurality of composite fragments, each of the composite fragments having a set of nucleotide fragments that include the nucleotide fragments in different ratios, and encoding the information into the composite fragments via an encoder.
[0012] According to another aspect of the invention, there is provided a computer-implemented method for interpreting information encoded in the complex fragments, the computer-implemented method including analyzing a polynucleotide sequence to determine a base sequence of each of the polynucleotide sequences, obtaining sequence ratios for each of the complex fragments corresponding to each position of the polynucleotide sequence, and decoding, with a decoder, information based on the sequence ratios for each of the complex fragments.
[0013] According to another aspect of the present invention, there is provided a computer program product for storing information in a polynucleotide, the computer program product including a computer readable storage medium having program instructions embodied therein, the program instructions being executable by a computer to cause the computer to use a plurality of types of nucleotide fragments to construct a plurality of composite fragments and encode information into the composite fragments via an encoder, each of the nucleotide fragments having an individually distinct base sequence, and each of the composite fragments having a set of nucleotide fragments that include the nucleotide fragments in different ratios.
[0014] According to another aspect of the present invention, there is provided a computer program product for interpreting information encoded in complex fragments, the computer program product including a computer readable storage medium having program instructions embodied therein, the program instructions being executable by a computer to cause the computer to analyze a polynucleotide sequence to determine a base sequence for each of the polynucleotide sequences, obtain a sequence ratio for each of the complex fragments corresponding to each position of the polynucleotide sequence, and decode, with a decoder, information based on the sequence ratio for each of the complex fragments.
[0015] According to yet another aspect of the invention, there is provided a system for storing information in a polynucleotide, comprising an encoder for mapping digital information to a set of complex fragments, a fragment assembly for biochemically linking the complex fragments to generate an encoded DNA molecule such that the mixture ratio at a sequence location represents a state vector, a sequencer for sampling from a pool of encoded DNA molecules at a predefined depth and counting the reads of each complex fragment, and a decoder for inferring the mixture ratio from a frequency vector, identifying the closest state vector, and mapping back to a binary representation.
[0016] In one preferred embodiment, the polynucleotide sequences are generated such that each of the nucleotide fragments of the composite fragment is incorporated into the same position in each of the polynucleotide sequences.
[0017] In another preferred embodiment, the encoder maps bits of digital information into a set of composite fragments.
[0018] In yet another preferred embodiment, the state vector of the composite fragment is
number
[0019] In yet another preferred embodiment, the resolution is:
number
[0020] In yet another preferred embodiment, the complete set of state vectors is:
number
[0021] In yet another preferred embodiment, a subset of the complete set of state vectors used for coding is
number
[0022] In yet another preferred embodiment, Σ m but,
number
[0023] In a preferred embodiment, each of the composite fragments has a set of nucleotide fragments in different ratios.
[0024] In another preferred embodiment, each of the nucleotide fragments has an individually different base sequence.
[0025] In yet another preferred embodiment, each of the composite fragments is integrated at the same position in each polynucleotide sequence.
[0026] In yet another preferred embodiment, the sequencer samples from a pool of encoded information at a given depth and counts the reads of each of the composite fragments.
[0027] In yet another preferred embodiment, the decoder identifies the closest state vector of the composite fragment.
[0028] In yet another preferred embodiment, the decoder further maps the composite fragment into a binary representation.
[0029] The advantage of the present invention is that at least for a given value k, the state |Φ n,kThe advantages of the present invention include that the number of | can increase significantly with n. The composite fragment approach (n>4) is advantageous because it can compress more information in a single synthesis cycle (e.g., bits / synthesis). In addition, the "depth" required to achieve threshold accuracy (e.g., 90%) increases only with k, not with n. The composite fragment approach is therefore advantageous because it can achieve higher bits / synthesis without compromising readout accuracy and cost. The cost and time of synthesis are advantageously improved by a factor proportional to the ratio of bits / synthesis achieved by the composite fragment (n>4) to that of the composite DNA (n=4). Furthermore, improvements can be realized by increasing n and using efficient fragment assembly and microfluidics techniques, estimating at least a three-fold and two-fold improvement in speed and cost, respectively, compared to the composite DNA approach.
[0030] Other advantageous results relate to shallow sequencing, redundancy, and efficient readout. For example, for shallow sequencing, to achieve a given bit / composite value, the composite fragment approach allows for smaller values of k. A shallower sequence is sufficient to achieve the required accuracy, and the readout cost is significantly reduced. For redundancy, the large number of states obtained by the composite fragment allows for redundant representation of the same data using different sets of fragments, providing flexibility and robustness for the implementation of unique error mitigation techniques. For efficient readout, to significantly increase the readout efficiency, nanopore sequencers can be used to read out composite fragments by recognizing different signal patterns of the fragments as opposed to identifying single nucleotides.
[0031] It should be noted that exemplary embodiments are described with reference to different subject matter. In particular, some embodiments are described with reference to method type claims, and other embodiments are described with reference to apparatus type claims. However, a person skilled in the art will infer from the above and following description that, unless otherwise notified, in addition to any combination of features belonging to one type of subject matter, any combination of features relating to different subject matters, in particular any combination of features of a method type claim and a feature of an apparatus type claim, is also considered to be described in this specification.
[0032] These and other features and advantages will become apparent from the following detailed description of illustrative embodiments, which should be read in connection with the accompanying drawings.
[0033] The invention is provided in more detail in the following description of preferred embodiments with reference to the following drawings. [Brief description of the drawings]
[0034] [Figure 1] FIG. 2 is a block / flow diagram of an exemplary composite fragment, i.e., display of the location of a DNA sequence including a mixture of fragments, according to an embodiment of the present invention. [Diagram 2] 2 is a block / flow diagram of an exemplary encoding and decoding system and method using the composite fragment of FIG. 1 according to an embodiment of the present invention. [Diagram 3] 4 is a block / flow diagram of an exemplary method for encoding and decoding a composite fragment, according to an embodiment of the present invention. [Figure 4] FIG. 2 is a block / flow diagram of an exemplary method for storing information in a polynucleotide, according to an embodiment of the present invention. [Diagram 5] FIG. 1 is a block / flow diagram of an exemplary method for interpreting information encoded in complex fragments, each of which has a set of nucleotide fragments in different ratios, according to an embodiment of the present invention. [Figure 6]FIG. 1 illustrates compressing more information in a single synthesis cycle according to an embodiment of the present invention. [Figure 7] FIG. 1 illustrates achieving higher bits / synthesis without compromising readout accuracy and cost according to an embodiment of the present invention. [Figure 8] FIG. 1 illustrates an improvement in combining cost and time with a factor proportional to the bits / combining ratio achieved by composite fragments in accordance with an embodiment of the present invention. [Figure 9] FIG. 1 is a block / flow diagram of an exemplary processing system for using composite fragments for DNA data storage, according to an embodiment of the present invention. [Figure 10] FIG. 2 is a block / flow diagram of an exemplary cloud computing environment, in accordance with an embodiment of the present invention. [Figure 11] 2 is a schematic diagram of exemplary abstraction model layers according to an embodiment of the present invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0035] Throughout the drawings, the same or similar reference numbers represent the same or similar elements.
[0036] Embodiments according to the present invention provide methods and devices for DNA data storage using composite fragments.
[0037] All the world’s data, every digital photo and tweet, every record of the international financial sector, every satellite image, images of melting glaciers, every simulation that underpins much of modern science, and much more, need to get somewhere. The “cloud” is not a cloud at all. It is digital data centers housed in giant warehouses that consume vast amounts of electricity to store (and keep cool) trillions of millions of bytes. Costing billions of dollars to build, power, and operate, these data centers may struggle to survive as the need for data storage continues to grow exponentially. DNA holds great promise for satisfying the world’s voracious appetite for data storage. The technology requires new tools and new ways of applying familiar tools. It would not be surprising if one day the world’s most precious archives find a new home in a collection of molecules the size of a poppy seed.
[0038] The process of DNA data storage combines DNA synthesis, DNA sequencing, and encoding and decoding algorithms to compress information into DNA with greater durability and greater density than is possible with conventional media. Information can be as much as 17 exabytes per gram. As a result, DNA has attracted great interest as a digital information storage medium because it is denser and more durable than existing silicon-based storage media. For example, DNA is at least 1000 times denser than most compact solid-state hard drives and at least 300 times more durable than most stable magnetic tapes. DNA's four-letter nucleotide code provides a suitable coding environment that can be exploited similarly to the binary digital codes that computers and other electronic devices use to represent letters, numbers, or other characters. Despite these advantages, DNA has not yet become widespread as an information storage medium because the cost of chemically synthesizing DNA is prohibitively high.
[0039] Exemplary embodiments of the present invention alleviate such problems by advantageously storing DNA using composite fragments.
[0040] Although the present invention is described with respect to a given exemplary architecture, it is understood that other architectures, structures, substrate materials, process features, and steps / blocks can vary within the scope of the present invention. It should be noted that for clarity, certain features may not be shown in every figure. This is not intended to be construed as limiting any particular embodiment, or illustration, or the scope of the claims.
[0041] FIG. 1 is a block / flow diagram of an exemplary composite fragment, ie, a representation of the location of a DNA sequence including a mixture of fragments, according to an embodiment of the present invention.
[0042] Nucleotide 10 is incorporated into nucleotide fragment 20.
[0043] Nucleotide 10 contains adenine 12 (A), thymine 18 (T), guanine 16 (G), and cytosine 14 (C), which are the basis of all DNA codes.
[0044] A fragment 20 is generated. For example, a first fragment 22, a second fragment 24, a third fragment 26, and a fourth fragment 28 are generated. Each fragment 22, 24, 26, 28 is a different sequence of nucleotides 10.
[0045] Next, a composite piece 30 is advantageously created.
[0046] For composite fragments, n≦4 l The fragments are selected based on an error prevention measure,
number
[0047] The state vector of the composite fragment is
number
[0048] For example, state vector 32(σ 1 ), 34(σ 2 ), 36(σ 3 ), 38(σ n ) is generated.
[0049] Resolution,
number
[0050] The complete set of state vectors is
number
[0051] m state vectors Σ m A subset of Φ is used for encoding. n,k is selected from.
number
[0052] Σ m , a vector
number
[0053] Thus, a composite fragment is a representation of the position of a DNA sequence that contains a mixture of fragments.
[0054] FIG. 2 is a block / flow diagram of an exemplary encoding and decoding system and method 40 using the composite fragment of FIG. 1 in accordance with an embodiment of the present invention.
[0055] An encoder 44 receives binary data 42. The binary data 42 may be referred to as p bits of digital information. The encoder 44 maps the p bits of digital information into a set of m composite fragments. The mapping may be expressed as {0,1} p →Σ m It can be expressed as:
[0056] Then, using fragment assembly 46, the mixture ratio at the sequence position is expressed as a state vector
number
number
[0057] The encoding DNA 48 is then produced.
[0058] A sequencer 50 samples the pool of encoding DNA molecules 48 at a given "depth" and counts the reads of each composite fragment.
[0059] A decoder 52 estimates the mix ratio from the frequency vector M and finds the closest
number
[0060] Therefore, the encoding scheme advantageously uses composite fragments to improve information density, synthesis speed, and cost performance index. The composite fragment is a representation of the position of the DNA sequence including the mixture ratio of the fragments. Thus, the exemplary embodiment uses composite fragments to increase the number of alphabets while keeping the composite resolution sufficiently low. This encoding scheme of the exemplary embodiment advantageously reduces the cost and time to store data in DNA by at least a factor of two compared to composite DNA. The exemplary method also provides the additional advantage of error correction.
[0061] FIG. 3 is a block / flow diagram of an exemplary method for encoding and decoding a composite fragment, according to an embodiment of the present invention.
[0062] At block 60, an encoder maps the p bits of digital information into a set of m composite fragments.
[0063] In block 62, the fragment assembly generates a state vector
number
[0064] In block 64, the sequencer samples from the pool of encoding DNA molecules at a given "depth" and counts the reads of each fragment.
[0065] In block 66, the decoder infers the mix ratio from the frequency vector M and finds the closest
number
[0066] FIG. 4 is a block / flow diagram of an exemplary method for storing information in a polynucleotide according to an embodiment of the present invention.
[0067] At block 70, a plurality of types of nucleotide fragments are provided, each of the nucleotide fragments having a different base sequence (A, G, C, T).
[0068] At block 72, a plurality of composite fragments are constructed, each of the composite fragments having a set of nucleotide fragments that includes different ratios of nucleotide fragments.
[0069] At block 74, the information is encoded into the composite fragment.
[0070] FIG. 5 is a block / flow diagram of an exemplary method for interpreting information encoded in complex fragments, each of which has a set of nucleotide fragments in different ratios, according to an embodiment of the present invention.
[0071] At block 80, the polynucleotide sequences are analyzed to determine the sequence of each base in the polynucleotide sequence.
[0072] At block 82, a sequence ratio is obtained for each of the composite fragments corresponding to each position of the polynucleotide sequence.
[0073] At block 84, information is decoded based on the sequence ratios for each of the composite fragments.
[0074] FIG. 6 is a diagram illustrating compressing more information in a single synthesis cycle according to an embodiment of the present invention.
[0075] Exhibit 90 shows resolution (k) on the x-axis and bits / composite on the y-axis. The larger n, the larger the bits / composite.
[0076] The advantage of the present invention is that at least for a given value k, the state |Φ n,kThe problem is that the number of | can increase significantly with n. A composite fragment approach (n>4) is advantageous because it can compress more information in a single synthesis cycle (e.g., bits / synthesis).
[0077] FIG. 7 is a diagram illustrating achieving higher bits / composite without compromising readout accuracy and cost according to an embodiment of the present invention.
[0078] Diagram 100 shows resolution (k) on the x-axis and the "depth" required for a 90% accurate readout on the y-axis.
[0079] In addition, further advantages include that the "depth" required to achieve threshold accuracy (e.g., 90%) only grows with k, not n. Thus, the composite fragment approach is advantageous because it allows for higher bits / synthesis to be achieved without compromising readout accuracy and cost.
[0080] FIG. 8 illustrates the improvement in combining cost and time with a factor proportional to the bits / combining ratio achieved by composite fragments, in accordance with an embodiment of the present invention.
[0081] Exhibit 110 shows resolution (k) on the x-axis and improvement over complex DNA on the y-axis. The larger n, the greater the improvement over complex DNA.
[0082] The cost and time of synthesis are advantageously improved by a factor proportional to the ratio of bits / synthesis achieved by composite fragments (n>4) to that of composite DNA (n=4). Further improvements can be realized by increasing n and using efficient fragment assembly and microfluidics techniques, with estimates of at least a 3-fold and 2-fold improvement in speed and cost, respectively, compared to composite DNA approaches.
[0083] In summary, with respect to Figs. 6-8, other advantageous results relate to shallow sequencing, redundancy, and efficient readout. For example, with respect to shallow sequencing, to achieve a given bit / composite value, the composite fragment approach allows for smaller values of k. A shallower sequence is sufficient to achieve the required accuracy, and the readout cost is significantly reduced. With respect to redundancy, the large number of states obtained by the composite fragment allows for redundant representation of the same data using different sets of fragments, providing flexibility and robustness for the implementation of unique error mitigation techniques. With respect to efficient readout, to significantly increase the readout efficiency, the nanopore sequencer can be used to read out the composite fragments by recognizing different signal patterns of the fragments as opposed to identifying single nucleotides.
[0084] FIG. 9 is a block / flow diagram of an exemplary processing system for using composite fragments for DNA data storage, according to an embodiment of the present invention.
[0085] 9 is a block diagram of components of a system 200 including a computing device 205. It should be appreciated that FIG. 9 is merely provided to illustrate one implementation and is not intended to suggest any limitation with respect to the environments in which different embodiments may be implemented. Many modifications to the depicted environment may be made.
[0086] Computing device 205 includes communications fabric 202, which provides communication between computer processor 204, memory 206, persistent storage 208, communications unit 210, and input / output (I / O) interface 212. Communications fabric 202 may be implemented with any architecture designed to pass data and / or control information between processors (such as microprocessors, communications and network processors), system memory, peripheral devices, and any other hardware components in the system. For example, communications fabric 202 may be implemented with one or more buses.
[0087] The memory 206, the cache memory 216, and the persistent storage 208 are computer-readable storage media. In this embodiment, the memory 206 includes random access memory (RAM) 214. In another embodiment, the memory 206 may be flash memory. In general, the memory 206 may include any suitable volatile or non-volatile computer-readable storage medium.
[0088] In some embodiments of the invention, a program 225 is included that is operated by the DNA processing chip 222 as a component of the computing device 205. In other embodiments, the program 225 is stored in the persistent storage 208 and executed by the DNA processing chip 222 (to implement DNA data storage using composite fragments) in conjunction with one or more of the respective computer processors 204 via one or more memories of the memory 206. In this embodiment, the persistent storage 208 includes a magnetic hard disk drive. Instead of or in addition to a magnetic hard disk drive, the persistent storage 208 can include a solid state hard drive, a semiconductor storage device, a read only memory (ROM), an erasable programmable read only memory (EPROM), a flash memory, or any other computer readable storage medium capable of storing program instructions or digital information.
[0089] The media used by persistent storage 208 may be removable. For example, a removable hard drive may be used for persistent storage 208. Other examples include optical and magnetic disks, thumb drives, and smart cards that are inserted into a drive for transfer to another computer-readable storage medium that is also part of persistent storage 208.
[0090] In these examples, the communication unit 210 provides communication with other data processing systems or devices including resources of the distributed data processing environment. In these examples, the communication unit 210 includes one or more network interface cards. The communication unit 210 can provide communication using either or both physical and wireless communication links. The deep learning program 225 can be downloaded to the persistent storage 208 through the communication unit 210.
[0091] I / O interface 212 allows for the input and output of data with other devices that may be connected to computing system 200. For example, I / O interface 212 may provide a connection to external devices 218, such as a keyboard, keypad, touch screen, or other suitable input device, or a combination thereof. External devices 218 may also include portable computer-readable storage media, such as, for example, thumb drives, portable optical or magnetic disks, and memory cards.
[0092] Display 220 provides a mechanism for displaying data to a user and may be, for example, a computer monitor.
[0093] FIG. 10 is a block / flow diagram of an exemplary cloud computing environment in accordance with an embodiment of the present invention.
[0094] Although the present invention includes detailed descriptions of cloud computing, it should be understood that implementation of the teachings described herein is not limited to cloud computing environments. Rather, embodiments of the present invention may be implemented in conjunction with any other type of computing environment now known or later developed.
[0095] Cloud computing is a model of service delivery for enabling convenient, on-demand network access to a shared pool of configurable computing resources (e.g., networks, network bandwidth, servers, processing, memory, storage, applications, virtual machines, and services) that can be rapidly provisioned and released with minimal administrative effort or interaction with the service provider. The cloud model can include at least five characteristics, at least three service models, and at least four deployment models.
[0096] Its features are as follows.
[0097] On-Demand Self-Service: Cloud consumers can unilaterally provision computing capacity, such as server time and network storage, automatically as needed, without the need for human interaction with the provider of the service.
[0098] Broadband Network Access: Capabilities are available over the network and accessed through standard mechanisms that facilitate use by heterogeneous thin- or thick-client platforms (e.g., cell phones, laptops, and PDAs).
[0099] Resource Pooling: To serve multiple consumers using a multi-tenant model, a provider's computing resources are pooled, with different physical and virtual resources dynamically allocated and reallocated according to demand. Consumers generally have no control or knowledge about the exact location of the resources provided, but there is a sense of location independence in that they can specify a higher level of abstraction location (e.g., country, state, or data center).
[0100] Rapid Elasticity: Capabilities are rapidly and adaptively provisioned, in some cases automatically, so they can be rapidly scaled out, and rapidly released so they can be rapidly scaled in. To the consumer, the capabilities available for provisioning often appear unlimited, and any amount can be purchased at any time.
[0101] Metered Services: Cloud systems automatically control and optimize resource usage by leveraging metering capabilities at some level of abstraction appropriate to the type of service (e.g., storage, processing, bandwidth, and active user accounts). Resource usage can be monitored, controlled, and reported to provide transparency to both providers and consumers of utilized services.
[0102] The service model is as follows:
[0103] Software as a Service (SaaS): The functionality provided to the consumer is the use of the provider's applications running on a cloud infrastructure. The applications are accessible from a variety of client devices through thin-client interfaces such as web browsers (e.g., web-based email). The consumer does not manage or control the underlying cloud infrastructure, including the network, servers, operating systems, storage, or individual application functions, with the exception of limited user-specific application configuration settings.
[0104] Platform as a Service (PaaS): The capability offered to the consumer is the deployment of consumer-created or consumer-acquired applications, written using programming languages and tools supported by the provider, on a cloud infrastructure. The consumer does not manage or control the underlying cloud infrastructure, including networks, servers, operating systems, or storage, but does have control over the deployed applications and, in some cases, the application hosting environment configuration.
[0105] Infrastructure as a Service (IaaS): The functionality provided to the consumer is the provisioning of processing, storage, network, and other basic computing resources on which the consumer can deploy and run any software, which may include operating systems and applications. The consumer does not manage or control the underlying cloud infrastructure, but has control over the operating systems, storage, deployed applications, and possibly limited control over selected networking components (e.g., host firewalls).
[0106] The deployment models are as follows:
[0107] Private Cloud: This cloud infrastructure is operated solely for the organization. It may be managed by the organization or a third party and may exist on-premise or off-premise.
[0108] Community Cloud: This cloud infrastructure is shared by several organizations to support a specific community with common concerns (e.g., mission, security requirements, policies, and compliance concerns). It may be managed by the organization or a third party and may exist on-premise or off-premise.
[0109] Public Cloud: This cloud infrastructure is available to the general public or large industry organizations and is owned by organizations that sell cloud services.
[0110] Hybrid Cloud: This cloud infrastructure is a composite of two or more clouds (private, community, or public) that remain unique entities but are bound together by standardized or proprietary technologies that enable data and application portability (e.g., cloud bursting for load balancing between clouds).
[0111] Cloud computing environments are service-oriented with a focus on statelessness, loose coupling, modularity, and semantic interoperability. At the heart of cloud computing is an infrastructure that includes a network of interconnected nodes.
[0112] 10, a cloud computing environment 450 is shown that enables use cases of the present invention. As shown, the cloud computing environment 450 includes one or more cloud computing nodes 410 that can communicate with local computing devices used by cloud consumers, such as, for example, a personal digital assistant (PDA) or mobile phone 454A, a desktop computer 454B, a laptop computer 454C, or an automobile computer system 454N, or combinations thereof. The nodes 410 can communicate with each other. The nodes 410 can be physically or virtually grouped (not shown) in one or more networks, such as a private cloud, a community cloud, a public cloud, or a hybrid cloud, or combinations thereof, as previously described. This allows the cloud computing environment 450 to provide infrastructure, platform, and / or software as a service for which the cloud consumer does not need to maintain resources on a local computing device. It will be understood that the types of computing devices 454A-454N shown in FIG. 10 are merely exemplary, and that computing node 410 and cloud computing environment 450 can communicate (e.g., using a web browser) with any type of computerized device via any type of network and / or network-addressable connection.
[0113] 11 is a schematic diagram of an exemplary abstraction model layer according to an embodiment of the present invention. It should be understood in advance that the components, layers, and functions shown in FIG. 11 are merely exemplary, and the embodiments of the present invention are not limited thereto. As shown, the following layers and corresponding functions are provided:
[0114] Hardware and software layer 560 includes hardware and software components. Examples of hardware components include mainframes 561, reduced instruction set computing (RISC) architecture based servers 562, servers 563, blade servers 564, storage devices 565, and networks and networking components 566. In some embodiments, software components include network application server software 567 and database software 568.
[0115] The virtualization layer 570 provides an abstraction layer from which the following examples of virtual entities can be provided: virtual servers 571, virtual storage 572, virtual networks including virtual private networks 573, virtual applications and operating systems 574, and virtual clients 575.
[0116] In one example, the management layer 580 can provide the following functions: Resource provisioning 581 provides dynamic procurement of computing and other resources utilized to execute tasks within the cloud computing environment. Metering and pricing 582 provides cost tracking as resources are utilized within the cloud computing environment and billing or invoicing for the consumption of these resources. In one example, these resources can include application software licenses. Security provides identity verification of cloud consumers and tasks and protection of data and other resources. User portal 583 provides access to the cloud computing environment to consumers and system administrators. Service level management 584 provides cloud computing resource allocation and management so that required service levels are met. Service level agreement (SLA) planning and fulfillment 585 provides pre-arranging and procurement of cloud computing resources where future requirements are forecasted according to SLAs.
[0117] The workload tier 590 provides examples of functions for which a cloud computing environment can be utilized. Examples of workloads and functions that can be provided from this tier include mapping and navigation 541, software development and lifecycle management 592, virtual classroom instructional delivery 593, data analytics processing 594, transaction processing 595, and DNA data storage 40.
[0118] The present invention may be a system, a method, and / or a computer program product, which may include one or more computer-readable storage media having computer-readable program instructions for causing a processor to perform aspects of the present invention.
[0119] A computer readable storage medium may be a tangible device capable of holding and storing instructions for use by an instruction execution device. A computer readable storage medium may be, for example, but not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the above. A non-exhaustive list of more specific examples of computer readable storage media includes the following: portable computer diskettes, hard disks, random access memories, read-only memories, erasable programmable read-only memories (EPROMs or flash memories), static random access memories, portable compact disk read-only memories (CD-ROMs), digital versatile disks (DVDs), memory sticks, floppy disks, mechanically encoded devices such as punch cards or ridge structures in grooves in which instructions are recorded, and any suitable combination of the above. As used herein, a computer-readable storage medium should not be construed as a transitory signal per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission medium (e.g., light pulses passing through a fiber optic cable), or electrical signals transmitted over electrical wires.
[0120] The computer readable program instructions described herein may be downloaded from a computer readable storage medium into each computing / processing device or may be downloaded to an external computer or storage device over a network, such as the Internet, a local area network, a wide area network, or a wireless network, or a combination thereof. The network may include copper transmission cables, optical transmission fiber, wireless transmission, routers, firewalls, switches, gateway computers, and / or edge servers. A network adapter card or network interface in each computing / processing device receives the computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing / processing device.
[0121] The computer readable program instructions for carrying out the operations of the present invention may be source or object code written in any combination of one or more programming languages, including assembler instructions, instruction set architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state setting data, or conventional procedural programming languages, such as object oriented programming languages, such as Smalltalk®, C++, and the like, as well as the "C" programming language or similar programming languages. The computer readable program instructions may be executed entirely on the user's computer, partially on the user's computer, as a stand-alone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the latter case, the remote computer may be connected to the user's computer via any type of network, including a local area network (LAN) or wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, a programmable logic circuit, a field programmable gate array (FPGA), or a programmable logic array (PLA) may execute computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry to carry out aspects of the invention.
[0122] Aspects of the present invention are described herein with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer readable program instructions.
[0123] These computer readable program instructions may be provided to at least one processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to create a machine, such that the instructions, which are executed by the processor of the computer or other programmable data processing apparatus, create means for implementing the functions / acts specified in one or more blocks or modules of the flowcharts and / or block diagrams.
[0124] These computer readable program instructions may be stored on a computer readable storage medium such that the computer readable storage medium on which the instructions are stored comprises an article of manufacture containing instructions that implement aspects of the functions / operations specified in one or more blocks or modules of the flowcharts and / or block diagrams, and may direct a computer, programmable data processing device, or other device, or combination thereof, to function in a particular manner.
[0125] The computer readable program instructions may be loaded into a computer, other programmable data processing apparatus, or other device and cause the computer, other programmable apparatus, or other device to execute a sequence of operational blocks / steps to produce a computer-implemented process such that the instructions, which execute on the computer, other programmable apparatus, or other device, perform the functions / operations specified in one or more blocks or modules of the flowcharts and / or block diagrams.
[0126] The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowcharts or block diagrams may represent a module, segment, or portion of instructions, including one or more executable instructions for performing a specified logical function. In some alternative implementations, the functions described in the blocks may occur out of the order described in the figures. For example, two blocks shown in succession may in fact be executed substantially simultaneously, or the blocks may sometimes be executed in reverse order, depending on the functionality involved. It should also be noted that each block in the block diagrams and / or flowchart illustrations, and combinations of blocks in the block diagrams and / or flowchart illustrations, may be implemented by a dedicated hardware-based system that performs the specified functions or operations, or executes a combination of dedicated hardware and computer instructions.
[0127] References herein to "one embodiment" or "one embodiment" of the present principles, as well as other variations thereof, mean that a particular feature, structure, or characteristic, etc. described in connection with the embodiment is included in at least one embodiment of the present principles. Thus, the phrases "in one embodiment" or "in an embodiment" appearing in various places throughout this specification, as well as any other variations thereof, do not necessarily all refer to the same embodiment.
[0128] It should be understood that the use of any of " / ", "or or both", "at least one of" is intended to encompass, for example, in the case of "A / B", "A or B or both", "at least one of A and B", the selection of only the first listed alternative (A), or the selection of only the second listed alternative (B), or the selection of both alternatives (A and B). As a further example, in the case of "A, B, or C, or combinations thereof" and "at least one of A, B, and C", such language is intended to encompass the selection of only the first listed alternative (A), or the selection of only the second listed alternative (B), or the selection of only the third listed alternative (C), or the selection of only the first listed alternative and the second listed alternative (A and B), or the selection of only the first listed alternative and the third listed alternative (A and C), or the selection of only the second listed alternative and the third listed alternative (B and C), or the selection of all three alternatives (A and B and C). This can be extended to many of the items listed, as would be readily apparent to one of ordinary skill in this and related arts.
[0129] Having described preferred embodiments of methods and systems for DNA data storage using composite fragments, which are intended to be illustrative and not limiting, it should be noted that modifications and variations can be made by those skilled in the art in light of the above teachings. It is therefore to be understood that changes can be made in the particular embodiments described which are within the scope of the invention as outlined by the appended claims.
Claims
1. 1. A computer-implemented method for storing information in a polynucleotide, comprising: Using a plurality of types of nucleotide fragments, each of the nucleotide fragments having a different base sequence; constructing a plurality of composite fragments, each of the composite fragments having a set of the nucleotide fragments that includes the nucleotide fragments in a different ratio; encoding said information into said composite fragment by an encoder; The method includes:
2. 2. The computer-implemented method of claim 1, further comprising generating a polynucleotide sequence, wherein each of the nucleotide fragments of the composite fragment is incorporated into the same position of each of the polynucleotide sequences.
3. The computer-implemented method of claim 1 , wherein the encoder maps bits of digital information to the set of composite fragments.
4. The composite fragment state vector is [0010] where σ i 2. The computer-implemented method of claim 1, wherein k=0, 1, 2, ..., k is the number of the i-th fragment.
5. Resolution, [0025] 5. The computer-implemented method of claim 4, wherein:
6. The complete set of state vectors is [0030] 6. The computer-implemented method of claim 5, wherein:
7. a subset of the complete set of state vectors used for encoding, [0045] 7. The computer-implemented method of claim 6, wherein:
8. Σ m but, [0050] 8. The computer-implemented method of claim 7, wherein the vectors are selected to maximize the average distance between
9. Mapping the digital information into a set of composite fragments; Assembling the fragments and biochemically linking the composite fragments to generate an encoding DNA molecule such that the mixture ratios at sequence positions represent state vectors; Sampling from said pool of encoding DNA molecules at a predetermined depth and counting the reads of each composite fragment; inferring said mixture ratio from a frequency vector, identifying the closest state vector, and mapping it back to a binary representation; The computer-implemented method of claim 1 , further comprising:
10. 1. A computer-implemented method for interpreting information encoded in a complex fragment, comprising: analyzing polynucleotide sequences to determine the base sequence of each of the polynucleotide sequences; obtaining a sequence ratio for each of said composite fragments corresponding to each position of said polynucleotide sequence; decoding, with a decoder, the information based on the sequence ratio for each of the composite fragments; The method includes:
11. The computer-implemented method of claim 10 , wherein each of the composite fragments has a set of nucleotide fragments in different ratios.
12. 12. The computer-implemented method of claim 11, wherein each of the nucleotide fragments has an individually distinct base sequence.
13. 13. The computer-implemented method of claim 12, wherein each of the composite fragments is integrated into the same position of each polynucleotide sequence.
14. 11. The computer-implemented method of claim 10, wherein a sequencer samples from the pool of coding information at a predetermined depth and counts reads of each of the composite fragments.
15. The computer-implemented method of claim 10 , wherein the decoder identifies a closest state vector for the composite fragment.
16. The computer-implemented method of claim 15 , wherein the decoder further maps the composite fragment to a binary representation.
17. 1. A computer program product for storing information in a polynucleotide, comprising: a computer readable storage medium having program instructions embodied therein, the program instructions causing a computer to: Using multiple types of nucleotide fragments, Construct multiple composite fragments, Encoding the information into the composite fragment by an encoder. The method is executable by the computer to: each of the nucleotide fragments has a different base sequence; Each of the composite fragments has a set of the nucleotide fragments that includes different ratios of the nucleotide fragments.
18. 20. The computer program product of claim 17, wherein said polynucleotide sequences are generated and each of said nucleotide fragments of said composite fragments is incorporated into the same position of each of said polynucleotide sequences.
19. 20. The computer program product of claim 17, wherein the encoder maps bits of digital information to the set of composite fragments.
20. The composite fragment state vector is [006] where σ i 18. The computer program product of claim 17, wherein k=0, 1, 2, ..., k is the number of the i-th fragment.
21. The complete set of state vectors is [0070] 21. The computer program product of claim 20, wherein:
22. a subset of the complete set of state vectors used for encoding, [0080] 22. The computer program product of claim 21 , wherein:
23. 1. A computer program product for interpreting information encoded in a complex fragment, comprising: a computer readable storage medium having program instructions embodied therein, the program instructions causing a computer to: Analyzing the polynucleotide sequences to determine the base sequence of each of the polynucleotide sequences; obtaining a sequence ratio for each of the composite fragments corresponding to each position of the polynucleotide sequence; and decoding, with a decoder, the information based on the sequence ratio for each of the composite fragments. The computer program product is executable by the computer.
24. 24. The computer program product of claim 23, wherein each of the composite fragments has a set of nucleotide fragments in different ratios, each of the nucleotide fragments has an individually different base sequence, and each of the composite fragments is incorporated at the same position in each polynucleotide sequence.
25. 1. A system for storing information in a polynucleotide, comprising: an encoder for mapping digital information to a set of composite fragments; fragment assembly to biochemically link said composite fragments to generate an encoding DNA molecule such that the mixture ratios at sequence positions represent state vectors; a sequencer for sampling the pool of encoding DNA molecules at a predetermined depth and counting the reads of each composite fragment; a decoder for inferring said mixture ratio from a frequency vector, identifying the closest state vector, and mapping back to a binary representation; A system comprising:
26. The composite fragment state vector is [0090] where σ i 26. The system of claim 25, wherein k=0, 1, 2, ..., k is the number of the i-th fragment.
27. A computer program comprising program code means arranged to perform the method according to any one of claims 1 to 16, when said program is run on a computer.
Citation Information
Patent Citations
Methods, apparatus and systems for amplification-free DNA data storage
WO2019075100A1
