Method for storing information in DNA and corresponding methods for modifying and reading information

By converting information files into DNA sequences and segmenting them into oligonucleotide chains, adding adapters, and using feature extraction algorithms to generate feature sequences, the version control problem in DNA storage is solved, enabling efficient multi-version storage and retrieval.

CN117133360BActive Publication Date: 2026-11-03SHENZHEN HUADA GENE INST
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202210555439.5
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-05-20
Publication Date
2026-11-03
Estimated Expiration
2042-05-20

AI Technical Summary

Technical Problem

Existing DNA storage technology cannot achieve effective version control, which means that the entire storage and retrieval process needs to be repeated every time a file is modified, which is time-consuming and costly.

Method used

By employing information feature extraction technology, information files are converted into DNA sequences, segmented into oligonucleotide chains, and adapters are added to the sequences. Feature sequences are then generated using feature extraction algorithms to achieve storage and version control of multiple versions of files.

Benefits of technology

It enables easy version control in DNA storage, reduces storage requirements, increases storage density, and reduces the impact of contaminated sequences during the reading process through feature screening.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117133360B_ABST
    Figure CN117133360B_ABST
Patent Text Reader

Abstract

The application belongs to the technical field of biology, and discloses a DNA storage information method and a corresponding information reading method. The DNA storage information method comprises the following steps: a) converting an information file into a first DNA sequence, and dividing the first DNA sequence into a first group of oligonucleotide chains; b) extracting features from the information file, and converting the extracted features into a second DNA sequence, and optionally dividing the second DNA sequence into a second group of oligonucleotide chains; c) synthesizing the first group of oligonucleotide chains, and the second DNA sequence or the second group of oligonucleotide chains; and d) storing the synthesized DNA sequence sample. The application realizes version control of DNA storage, can save a large amount of DNA for storage when storing multiple versions of files, and further improves storage density; and provides a simple and feasible scheme for storing and modifying files.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention belongs to the field of information technology, and more specifically, this invention relates to a method for storing information in DNA and a method for modifying and retrieving the corresponding information. Background Technology

[0002] With the advent of the information explosion era, traditional storage technologies face enormous challenges. It is estimated that by 2050, the Earth's reserves of monocrystalline silicon will be insufficient for storing information. IT companies and research institutions in many countries have begun deploying DNA storage technology. DNA storage may replace traditional storage technologies and be applied to any field requiring data storage.

[0003] DNA storage technology boasts advantages such as extremely high storage density, extremely low maintenance costs, and extremely long storage time, making DNA an ideal medium for massive data storage. Currently, research and development in this field are underway both domestically and internationally, resulting in several feasible DNA storage solutions. However, based on current reports, no feasible solution for implementing version control in DNA storage has yet been found. This is extremely inconvenient and insecure for data storage.

[0004] The existing DNA storage "storage process" is as follows: a) converting the information file into DNA sequence information using a designed algorithm; b) synthesizing the converted DNA sequence using DNA synthesis technology; c) storing the synthesized DNA molecules using a designed method. This storage process allows DNA storage of information by storing a binary file containing information within DNA molecules. The existing DNA storage "reading process" is as follows: a) retrieving the stored DNA molecules and preprocessing them; b) using DNA sequencing technology to read the DNA sequence; c) converting the DNA sequence into a computer-readable binary file. This reading process extracts information from DNA molecules and converts it into a binary file, enabling the reading of information.

[0005] While the above process enables information storage and retrieval, even a minor modification to the source file necessitates repeating the entire process, incurring significant time and cost. Therefore, existing storage technologies cannot achieve version control of stored data, requiring each version to be stored separately, resulting in prolonged time consumption and high costs. Summary of the Invention

[0006] To address the issue of effective version control in existing DNA storage processes and expand the applicability of DNA storage technology, this invention proposes a novel process based on information feature extraction algorithms. This process enables version control of DNA storage, allowing for easy implementation when there are multiple versions of stored information or when minor modifications are required after storage.

[0007] Therefore, in a first aspect, the present invention provides a method for storing information in DNA, the method comprising: a) Convert the information file into a first DNA sequence, and divide the first DNA sequence into a first group of oligonucleotide chains; b) Extract features from the information file and convert the extracted features into a second DNA sequence, optionally dividing the second DNA sequence into a second group of oligonucleotide chains; c) Synthesize the first set of oligonucleotide chains and the second DNA sequence or the second set of oligonucleotide chains; d) Store the synthesized DNA sequence sample.

[0008] In one implementation, in a), the binary string of the information file is converted into a string consisting of four characters: ACTG. For example, the conversion method is selected from: Huffman coding, RS coding, Church coding, Grass coding, DNA fountain coding, and Yin-Yang coding.

[0009] In one embodiment, in b), the second DNA sequence is segmented into a second group of oligonucleotide chains according to the size of the second DNA sequence.

[0010] In one implementation, in b), the first DNA sequence is feature extracted to obtain a second DNA sequence.

[0011] In one implementation, a first linker is added to the first set of oligonucleotide chains.

[0012] In one implementation, the first connector includes an identifier, a primer, and / or an index.

[0013] In one embodiment, a second adapter is added to the second DNA sequence or a second set of oligonucleotide chains cleaved therefrom.

[0014] In one embodiment, the second connector includes an identifier, a primer, and / or an index.

[0015] In one embodiment, the oligonucleotide chain has a length of 150-400 bp, preferably 200-300 bp, and more preferably 254 bp.

[0016] In one implementation, in c), the connector sequence is added during synthesis or after synthesis by joining.

[0017] In one embodiment, in d), the synthesized first set of oligonucleotide chains and the synthesized second DNA sequence or second set of oligonucleotide chains are stored together or separately.

[0018] In a second aspect, the present invention provides a method for modifying DNA storage information according to the first aspect of the present invention, the method comprising: a) Obtain the updated oligonucleotide chain in the first group of oligonucleotide chains corresponding to the modified information file; b) Extract features from the modified information file and convert the extracted features into a third DNA sequence. Optionally, the third DNA sequence may be divided into a third group of oligonucleotide chains. c) Synthesize the updated oligonucleotide chain, and the third DNA sequence or third group of oligonucleotide chains; d) Store the synthesized DNA sequence sample.

[0019] In a third aspect, the present invention provides a method for reading DNA stored information, the method comprising: e) Sequencing the stored DNA sequence samples to obtain the sequencing sequence; f) Based on the characteristic information in the sequencing sequence, reconstruct the DNA sequence corresponding to the sequencing sequence information file; g) Convert the restored DNA sequence to obtain an information file.

[0020] In one implementation, the feature information in the sequencing sequence includes feature information specific to the original information file and feature information specific to the modified information file.

[0021] This invention achieves version control for DNA storage, which can save a lot of DNA when storing multiple versions of files, thereby further improving storage density; it provides a simple and feasible solution for modifying files after storage; and because the target sequence is screened by feature selection during the reading process, the influence of contaminated sequences during the reading process can be effectively reduced or avoided. Attached Figure Description

[0022] The present invention will be described with reference to the following figures: Figure 1 This is the standard procedure for DNA storage.

[0023] Figure 2 This is an example of a version control process.

[0024] Figure 3This is an example of Sanger sequencing results. Detailed Implementation

[0025] Figure 1 This illustrates a typical DNA storage process and the corresponding information retrieval process. During storage, the original file is converted into binary information, then encoded (e.g., Huffman coding, Yin-Yang coding, RS coding, Church coding, Grass coding, DNA fountain coding, etc.) to complete DNA sequence conversion. Primers and indexes are designed for the DNA sequence, followed by oligonucleotide synthesis and in vivo or in vitro storage. During retrieval, the stored DNA sequence is sequenced, reordered to obtain the DNA sequence, decoded to obtain binary information, and finally, the original file is formed. In this invention, text is converted into computer-encoded binary strings, which are then encoded into strings composed of the four characters ACTG, for example, the corresponding mapping relationship is: "00->A; 01->C; 10->G; 11->T".

[0026] Figure 2 This is an example of a version control process. Assume there is a file F. During initial storage (version 1), its information features are extracted, generating binary information BF1. During DNA storage, F and BF1 are synthesized and stored using a conventional DNA storage process. In this invention, feature extraction refers to using algorithms or functions, such as hash algorithms, to calculate feature vectors for the information, resulting in binary vectors—the binary information after feature extraction. In this invention, feature vector calculations can be performed on the information file itself, its binary string, or its converted ACTG string; i.e., feature extraction. These methods can be used in variations without affecting the implementation of this invention, and these variations are all within the scope of the appended claims. Using this feature information, it is possible to retrieve whether an element (i.e., a string) belongs to the original data set. For example, the verification method is to calculate the element using a pre-defined hash algorithm or function. If every bit in the corresponding feature vector is 1, then the element belongs to the original data set; if there are bits that are not 1, then it does not belong to the original data set.

[0027] In the present invention, according to the size of the sequence, the DNA sequence can be divided into oligonucleotide strands for synthesis, and the length of the oligonucleotide strands is 150-400 bp, preferably 200-300 bp, more preferably 254 bp. It is determined whether to divide the DNA sequence subjected to feature conversion into sets of oligonucleotide strands according to its size. For example, if its length is below 400 bp, it may not be divided, and the purpose of division takes into account the cost of oligonucleotide strand synthesis. In the present invention, adapters can be added to the oligonucleotide strands, and the adapters can be added to one end or both ends of the DNA strands. The adapter sequence includes one or more selected from the following: identifiers, primers and / or indices. The identifier is used to identify the type of the sequence, and the index is used to identify the order of the sequence. The selection and design of the identifiers, primers and / or indices can be performed by any method in the art. The adapter sequence can be directly added to the oligonucleotide strand during synthesis by synthesis, or the adapter sequence can be added by ligation after the oligonucleotide strand is synthesized.

[0028] In the present invention, for file modification, at the text level, a difference is defined as a different character (the character at the nth position in the mth line); the same applies at the binary string level; at the ACTG string level, it is only necessary to record which base of which DNA has changed. After the file is modified, the binary vector values obtained by extracting the features of different versions of the file are different, and they will be stored separately. It is also possible to add tags for distinguishing sequences to the sequences for combined storage. For example, the original text is "不知填上宫缺", and the modified version is "不知天上宫阙", then the 3rd and 6th characters are different, and the corresponding binary strings have different 3rd and 5th bytes; the DNA sequence corresponding to the original version is assumed to be "ATCGTGCATCGATTAAGGTCCTGG"; then the modified version is "ATCGTGCATTGATTAAGGTCGTAG". The feature vector corresponding to the original version is assumed to be "00101010", then the feature vector of the modified version is "11010001". Therefore, when the file needs to be modified (version 2), the binary information BF2 after feature extraction of the lines is regenerated through feature information extraction, and the information difference between version 1 and version 2 is set as V1 and V2. The modification process only needs to synthesize V2 and BF2 through a conventional process, mix V2 with the original DNA file F, and store BF2 separately. During the reading process, only one sequencing of the original DNA file (F+V2) is required, and through BF1, we can only recover the information of version 1; similarly, through BF2, we can only recover the information of version 2. In the DNA storage process, the storage of DNA information and corresponding information reading are realized through the following storage process and reading process.

[0029] In one implementation, the "storage process" of the DNA workflow is as follows: a) converting the information file into first DNA sequence information; b) extracting features from the generated DNA sequence information and converting it into second DNA sequence information; c) synthesizing all DNA sequence information using DNA synthesis technology, segmenting the DNA sequences according to their length, and introducing adapters including markers, primers, and / or indexes as needed; d) storing the synthesized DNA molecules. This storage process stores both the information of the file to be stored and the feature information of the DNA sequences converted from the file information. When implementing multi-version data storage, the first two steps are performed separately for different versions, while in step c), the same sequences between different versions only need to be synthesized once, and finally, all DNA molecules are stored in the same sample tube. When implementing subsequent version updates, the first two steps proceed normally; in steps c) and d), only the DNA sequences that were not previously synthesized need to be synthesized and mixed into the original stored sample at an appropriate concentration.

[0030] The information used for data recovery is binary information obtained from a DNA sequence set based on binary vectors and then encoded. During information recovery, by determining whether the obtained ACTG sequence or the decoded binary sequence belongs to the original data set, and extracting the obtained binary vectors based on different features, the desired dataset (before / after modification) can be obtained. In one embodiment, the "read process" of the DNA workflow of this invention is as follows: e) Retrieve the stored DNA sequence sample, perform preprocessing, and use DNA sequencing technology to read the DNA sequence, including first DNA sequence information representing the information file and second DNA sequence information representing the features of the first DNA sequence information; f) Obtain feature information from the second DNA sequence information; g) Based on the feature information of the file, filter out the target DNA sequence of the file, and convert the DNA sequence into a computer-readable binary file. Through this read process, the feature information of different versions of DNA sequences is first read out, and then the feature information is used to filter out different versions of DNA sequences from all DNA sequences, realizing the reading of different versions of file information existing in DNA molecules and achieving effective version control.

[0031] The present invention will be described in detail below through examples.

[0032] Example: DNA storage of two versions of "Shuidiao Getou".

[0033] a) Version 1: Water Melody Su Shi When will the moon be clear and bright? I raise my cup to ask the heavens. I wonder what year it is in the celestial palace, with its vacant gates. I long to ride the wind and return, yet fear the jade towers and crystal palaces, where the cold is unbearable at such heights. Dancing with my shadow, how can it compare to being in the mortal world? The moon shines through the red pavilion, lowers its light through the embroidered window, illuminating my sleepless night. There should be no resentment, yet why is the moon always full when we are apart? People experience sorrow and joy, separation and reunion; the moon waxes and wanes, and such things have always been imperfect. I only wish that we may all live long and share the beauty of the moon, even from afar.

[0034] b) Version 2: Water Melody Su Shi When will the moon be clear and bright? I raise my cup to ask the heavens. I wonder what year it is in the celestial palaces. I long to ride the wind and return, yet fear the jade towers and crystal palaces, where the cold is unbearable at such heights. Dancing with my shadow, how can it compare to being in the mortal world? The moon shines through the red pavilion, lowers its light through the embroidered window, illuminating my sleepless night. There should be no resentment, yet why is the moon always full when we are apart? People experience sorrow and joy, separation and reunion; the moon waxes and wanes, and such things have always been imperfect. I only wish that we may all live long and share the beauty of the moon, even from afar.

[0035] The DNA storage process is as follows: c) Convert the two versions of Shui Diao Ge Tou into DNA sequences: The encoding rule uses a simple encoding method, where two binary digits correspond to four bases: 00 corresponds to base A, 01 to base T, 10 to base C, and 11 to base G. Decoding is performed by reversing the operation. Sequence indices are arranged in descending order of numbers and simultaneously converted to bases. All sequences use the same PCR primers.

[0036] The DNA sequence converted from version one is as follows: 'GTGCCAATTGTCAAGCTAAGTTCAGCTTTCGGGGCTTCTAACTATGCTTCACACCCGGCTCCTTGCGTCGCTTCTGACATCGCGGCGGACTGGGCTACGCCCGCCGCTCCTGACACTGCTCCAACCGACGCTCCCGACCACGCTGCCTCCGCGGCTTCTAACACAGCGGCGGACAGAGCTCCTGACACAGCTCCTGACACTGCCTCTCACGTAGCTCCTCTCGTAAATTGTAGACTGAACATTGGCACCTGATC', (SEQ ID NO.1)'GTGCCAATTGTCAAGCTAAGTTCAGCGACGCTACGCTCTCAGCCTCCAGCAGCGCTTCGGTCTACGCTTCAGCCGCGGCGGCGGACAGAGCTTCAGGCACAGCTCCAATCTAAGCTGCTAACGGAGCTCCCTTCGGAGCTGCAGCCACTGCTTCCGCCATGGCGGCGGACAGAGCCTCCCGCTCAGCTTCCTACATAGCTACGCACAGTGCCACAAGCTGAGCTTAAACGTAGACTGAACATTGGCACCTGATC', (SEQ ID NO.2)'GTGCCAATTGTCAAGCTAAGTTCAGCAATGCGGCGGACAGAGCTACGGTCAGCGCTGCGCGCCGCGCTCCACACGTGGCGGCGGACAGAGCTGCATTCCTGGCTCCTTGCCAAGCTGCTGACCAAGCAGCAAACAACGCTACGCACAGTGCTTCGCCCTTAGCTCCTGACACTGCTCCAATCCCAGCGGCGGACAGAGCTACGGTCTTTGCTACGCCCACGGCCTAATAGTAGACTGAACATTGGCACCTGATC', (SEQ ID NO.3)'GTGCCAATTGTCAAGCTAAGTTCAGCCGGCTACGCAGCAAACAACGCCACGTTCGTGGCCACACACTGCGCTTCGGACATAGCTCCGCACATTGCTTCGGTCGATGCGGCGGACAGAGCTACGGTCTTTGCTACGGACGGAGCTTCTGACCCAGCTACGCCCGCCGCCTCTTGCGTAGCGGCGGACTGGAACCGCCACGGTCCGAGCTCCTGACGATGCCTCTCAAAAGGTAGACTGAACATTGGCACCTGATC', (SEQ ID NO.4)'GTGCCAATTGTCAAGCTAAGTTCAGGCTTCCTACCCTGCAGCAAACAACGCTACGCACAGTGCTGCTGGCCTTGCTTCCTACCCTGCTACGCACACCGCTTCCGCCCCGGCTGCGGACGCCGCGGCGGACAGAGCTACGCGCACCGCTCCTCACTTAGCTCCTCACCGGGCTACGGTCTTTGCTTCGCTCGTAGCAGCAAACAACGCTCCACACTATGCTCCCGAAAATGTAGACTGAACATTGGCACCTGATC', (SEQ ID NO.5)'GTGCCAATTGTCAAGCTAAGTTCAGGCTCCGAACGTAGCCACGAACAAGGCTCCCGTCAGAGCTTCCTACGTAAACCGCCACACGCAGGGCCACGGTCGGAAACCGCTCCTCACAGCGCTCCTGACACAGCTTCATGCCAAGCTCCTTGCGTCGCTCCTGACACTGCGGCGGACTGGGCTCCACCCACCGCCTCATTCTACGCCTCTTGCCGCGCCTCTGTCTACAAAAGTAGACTGAACATTGGCACCTGATC', (SEQ ID NO.6) 'GTGCCAATTGTCAAGCTAAGTTCAGGCTTCTGACATCGCTGCGGACGCCGCGGCGGACAGAGCTCCCGTCCTAGCTACGCCCACGGCTTCAGGCCTAGCCTCTCCCGGCGCTTCATTCCCAGCAGCAAACAACGCTACGGTCATCGCTCCATACGGGGCTACGCCCGCCGCCTCTTTCGGGGCTACGCTCATTGCGGCGGACAGAGCTTCAGTCAAGGCCTCATGAATCGTAGACTGAACATTGGCACCTGATC', (SEQ ID NO.7) 'GTGCCAATTGTCAAGCTAAGTTCAGCAGAGCTTCATTCGATGCTTCCCTCGTTGCTTCCCACTGGGCAGCAAACAACAACCTATGTCTTTCGCTCTTTGACTCATTGTATCTTTCTAACAATCACTGCTACAATTAGTCCATCCTTCCATCGGTCGCTCTGACAATAAGTACATATTTAGCACGAACAATTCCTCCATCCTACAATTAATACTTAGCTATGACGAAATGGTAGACTGAACATTGGCACCTGATC' (SEQ ID NO.8). The DNA sequence converted by version two is: 'GTGCCAATTGTCAAGCTAAGTTCAGCTTTCGGGGCTTCTAACTATGCTTCACACCCGGCTCCTTGCGTCGCTTCTGACATCGCGGCGGACTGGGCTACGCCCGCCGCTCCTGACACTGCTCCAACCGACGCTCCCGACCACGCTGCCTCCGCGGCTTCTAACACAGCGGCGGACAGAGCTCCTGACACAGCTCCTGACACTGCCTCTCACGTAGCTCCTCTCGTAAATTGTAGACTGAACATTGGCACCTGATC', (SEQ ID NO.1)'GTGCCAATTGTCAAGCTAAGTTCAGCGACGCTACGCTCTCAGCCTCCAGCAGCGCTTCGGTCTACGCTTCAGCCGCGGCGGCGGACAGAGCTTCAGGCACAGCTCCAATCTAAGCTGCTAACGGAGCTCCCTTCGGAGCTGCAGCCACTGCTTCCGCCATGGCGGCGGACAGAGCCTCCCGCTCAGCTTCCTACATAGCTACGCACAGTGCCACAAGCTGAGCTTAAACGTAGACTGAACATTGGCACCTGATC', (SEQ ID NO.2)'GTGCCAATTGTCAAGCTAAGTTCAGCAATGCGGCGGACAGAGCTACGGTCAGCGCTGCGCGCCGCGCTCCACACGTGGCGGCGGACAGAGCTGCATTCCTGGCTCCTTGCCAAGCTGCTGACCAAGCAGCAAACAACGCTACGCACAGTGCTTCGCCCTTAGCTCCTGACACTGCTCCAATCCCAGCGGCGGACAGAGCTACGGTCTTTGCTACGCCCACGGCCTAATAGTAGACTGAACATTGGCACCTGATC', (SEQ ID NO.3)'GTGCCAATTGTCAAGCTAAGTTCAGCCGGCTACGCAGCAAACAACGCCACGTTCGTGGCCACACACTGCGCTTCGGACATAGCTCCGCACATTGCTTCGGTCGATGCGGCGGACAGAGCTACGGTCTTTGCTACGGACGGAGCTTCTGACCCAGCTACGCCCGCCGCCTCTTGCGTAGCGGCGGACTGGAACCGCCACGGTCCGAGCTCCTGACGATGCCTCTCAAAAGGTAGACTGAACATTGGCACCTGATC', (SEQ ID NO.4)'GTGCCAATTGTCAAGCTAAGTTCAGGCTTCCTACCCTGCAGCAAACAACGCTACGCACAGTGCTGCTGGCCTTGCTTCCTACCCTGCTACGCACACCGCTTCCGCCCCGGCCTCTCACTCTGCGGCGGACAGAGCTACGCGCACCGCTCCTCACTTAGCTCCTCACCGGGCTACGGTCTTTGCTTCGCTCGTAGCAGCAAACAACGCTCCACACTATGCTCCCGAAAATGTAGACTGAACATTGGCACCTGATC', (SEQ ID NO.9)'GTGCCAATTGTCAAGCTAAGTTCAGGCTCCGAACGTAGCCACGAACAAGGCTCCCGTCAGAGCTTCCTACGTAAACCGCCACACGCAGGGCCACGGTCGGAAACCGCTCCTCACAGCGCTCCTGACACAGCTTCATGCCAAGCTCCTTGCGTCGCTCCTGACACTGCGGCGGACTGGGCTCCACCCACCGCCTCATTCTACGCCTCTTGCCGCGCCTCTGTCTACAAAAGTAGACTGAACATTGGCACCTGATC', (SEQ ID NO.6) 'GTGCCAATTGTCAAGCTAAGTTCAGGCTTCTGACATCGCTGCGGACGCCGCGGCGGACAGAGCTCCCGTCCTAGCTACGCCCACGGCTTCAGGCCTAGCCTCTCCCGGCGCTTCATTCCCAGCAGCAA ACAACGCTACGGTCATCGCTCCATACGGGGCTACGCCCGCCGCCTCTTTCGGGGCTACGCTCATTGCGGCGGCAGAGCTTCAGTCAAGGCCTCATGAATCGTAGACTGAACATTGGCACCTGATC' (SEQ IDNO.7) 'GTGCCAATTGTCAAGCTAAGTTCAGCAGAGCTTCATTCGATGCTTCCCTCGTTGCTTCCCACTGGGCAGCAAACAACAACCTATGTCTTTCGCTCTTTGACTCATTGTATCTTTCTAACAATCAC TGCTACAATTAGTCCATCCTTCCATCGGTCGCTCTGACAATAAGTACATATTTAGCACGAACAATTCCTCCATCCTACAATTAATACTTAGCTATGACGAAATGGTAGACTGAACATTGGCACCTGATC' (SEQ ID NO.8). d) Extract sequence features from each version The steps for extracting features from a sequence set using a Bloom filter are as follows: 1) Generate an empty Bloom filter. Based on the preset false positive rate limit... (This case selects 10%), dataset size (The dataset size in this case is 8) Calculate and obtain the length L of the Bloom filter, generate binary information of the corresponding length, and initialize it to 0; at the same time, calculate and obtain the number of key information bits for each sequence. .

[0037] 2) Calculate the feature information of each sequence using a hash function and record it in the Bloom filter. Based on the parameters obtained in step 1, convert each sequence into corresponding information and record it at the corresponding position in the Bloom filter. The specific process is as follows: (1) Use SHA1 to convert the DNA sequence into a high-order integer (hash). (2) Based on the number of information bits ,choose Perform modulo operations on the previously obtained integers with appropriate values ​​to obtain a total of One eigenvalue; (3) The results obtained in the previous step Each of the eigenvalues ​​is modulo L to obtain... One coordinate value; (4) Change the value at the corresponding coordinate of the bloom filter to 1.

[0038] 3) Export the generated bloom filter.

[0039] Through the steps described above, the Bloom Filter algorithm is used to extract features from the DNA sequence, obtaining binary information after feature extraction. Using a pre-defined Bloom filter algorithm, such as the SHA1 hash algorithm, the sequence features can be used to determine whether the input sequence belongs to the target version. As a feature extraction algorithm, the bit array (feature vector) of a Bloom Filter represents the relationship between multiple hash values ​​(positions in the bit array) of a single element and the selected set. If each hash value obtained by the element corresponds to a bit value of 1 in the bit array, then the element can be determined to be likely in the selected set. Its false positive rate depends on the design of the hash function set and the length of the bit matrix. Alternatively, models capable of binary classification tasks, such as neural networks, support vector machines, and decision trees, can also be used; the parameters of these models can also be considered as extracted features.

[0040] The sequence feature information of different versions is also converted into DNA information.

[0041] The DNA sequence converted from the feature information of version 1 is as follows: 'CAATAGATGGATGGATTGATCTATTCATAGATATTTTTATCATTCCGACCGAACATCTATATTTCCGAGATTACATTAATGAGATAGAGCGAACATGATTCCGAGTGAGCGACTATGATTCCGATAGACAGAACGAGCGACAATCTATCCGAACCTATGGCTAGGCCCAAGCGTGGAACCCGACTTTTGTTACTATATAGGCTCTGGCCCACCGA' (SEQ ID NO.10) The DNA sequence converted from the feature information of version 2 is as follows: 'CAATAGATGGATGGATTGATCTATTCATAGATATTTTTATCATTCCGACCGAACATCTATATTTCCGAGATTACATTAATGAGATAGAGCGAACATGATTCCGAGTGAGCGACTATGATTCCGATAGACAGAACGAGCGACAATCTATCCGAACCTATGGCTAGGCCCAAGCGTGGACCCCGACTTTTGTTGACTATATACGCTCTGGCCCACCGA' (SEQ ID NO.11) e) After removing duplicates from all DNA sequences, the remaining DNA sequences are synthesized into a total of 11 sequences.

[0042] f) SEQ ID NO. 10 and SEQ ID NO. 11 store the feature information of version 1 and version 2 respectively, and need to be stored separately, while the others are stored together. The DNA molecules are stored in dry powder form at -20°C.

[0043] This completes the DNA storage process.

[0044] The information reading process is as follows: g) Remove the stored DNA molecules and dissolve them in water.

[0045] h) Sequencing each DNA molecule was performed using Sanger sequencing (in this example, the number of DNA molecules was small, so Sanger sequencing was used). Figure 3 This is an example of Sanger sequencing results. The figure shows that the sequencing results match the original design sequence. The obtained sequence information is as follows: GTGCCAATTGTCAAGCTAAGTTCAGCTTTCGGGGCTTCTAACTATGCTTCACACCCGGCTCCTTGCGTCGCTTCTGACATCGCGGCGGACTGGGCTACGCCCGCCGCTCCTGACACTGCTCCAACCGAC GCTCCCGACCACGCTGCCTCCGCGGCTTCTAACACAGCGCGGGACAGAGCTCCTGACACAGCTCCTGACACTGCCTCTCACGTAGCTCCTCTCGTAAATTGTAGACTGAACATTGGCACCTGATC (SEQ ID NO.1) GTGCCAATTGTCAAGCTAAGTTCAGCGACGCTACGCTCTCAGCCTCCAGCAGCGCTTCGGTCTACGCTTCAGCCGCGGCGGCGGACAGAGCTTCAGGCACAGCTCCAATCTAAGCTGCTAACGGAGCTCCCTTCGGAGCTGCAGCCACTGCTTCCGCCATGGCGGCGGACAGAGCCTCCCGCTCAGCTTCCTACATAGCTACGCACAGTGCCACAAGCTGAGCTTAAACGTAGACTGAACATTGGCACCTGATC(SEQ ID NO.2) GTGCCAATTGTCAAGCTAAGTTCAGCAATGCGGCGGACAGAGCTACGGTCAGCGCTGCGCGCCGCGCTCCACACGTGGCGGCGGACAGAGCTGCATTCCTGGCTCCTTGCCAAGCTGCTGACCAAGCAGCAAACAACGCTACGCACAGTGCTTCGCCCTTAGCTCCTGACACTGCTCCAATCCCAGCGGCGGACAGAGCTACGGTCTTTGCTACGCCCACGGCCTAATAGTAGACTGAACATTGGCACCTGATC(SEQ ID NO.3) GTGCCAATTGTCAAGCTAAGTTCAGCCGGCTACGCAGCAAACAACGCCACGTTCGTGGCCACACACTGCGCTTCGGACATAGCTCCGCACATTGCTTCGGTCGATGCGGCGGACAGAGCTACGGTCTTTGCTACGGACGGAGCTTCTGACCCAGCTACGCCCGCCGCCTCTTGCGTAGCGGCGGACTGGAACCGCCACGGTCCGAGCTCCTGACGATGCCTCTCAAAAGGTAGACTGAACATTGGCACCTGATC(SEQ ID NO.4) GTGCCAATTGTCAAGCTAAGTTCAGGCTTCCTACCCTGCAGCAAACAACGCTACGCACAGTGCTGCTGGCCTTGCTTCCTACCCTGCTACGCACACCGCTTCCGCCCCGGCCTCTCACTCTGCGGCGGACAGAGCTACGCGCACCGCTCCTCACTTAGCTCCTCACCGGGCTACGGTCTTTGCTTCGCTCGTAGCAGCAAACAACGCTCCACACTATGCTCCCGAAAATGTAGACTGAACATTGGCACCTGATC(SEQ ID NO.9) GTGCCAATTGTCAAGCTAAGTTCAGGCTTCCTACCCTGCAGCAAACAACGCTACGCACAGTGCTGCTGGCCTTGCTTCCTACCCTGCTACGCACACCGCTTCCGCCCCGGCTGCGGACGCCGCGGCGGACAGAGCTACGCGCACCGCTCCTCACTTAGCTCCTCACCGGGCTACGGTCTTTGCTTCGCTCGTAGCAGCAAACAACGCTCCACACTATGCTCCCGAAAATGTAGACTGAACATTGGCACCTGATC(SEQ ID NO.5) GTGCCAATTGTCAAGCTAAGTTCAGGCTCCGAACGTAGCCACGAACAAGGCTCCCGTCAGAGCTTCCTACGTAAACCGCCACACGCAGGGCCACGGTCGGAAACCGCTCCTCACAGCGCTCCTGACACAGCTTCATGCCAAGCTCCTTGCGTCGCTCCTGACACTGCGGCGGACTGGGCTCCACCCACCGCCTCATTCTACGCCTCTTGCCGCGCCTCTGTCTACAAAAGTAGACTGAACATTGGCACCTGATC(SEQ ID NO.6) GTGCCAATTGTCAAGCTAAGTTCAGGCTTCTGACATCGCTGCGGACGCCGCGGCGGACAGAGCTCCCGTCCTAGCTACGCCCACGGCTTCAGGCCTAGCCTCTCCCGGCGCTTCATTCCCAGCAGCAAA CAACGCTACGGTCATCGCTCCATACGGGGCTACGCCCGCCGCCTCTTTCGGGGCTACGCTCATTGCGGCGGCAGAGCTTCAGTCAAGGCCTCATGAATCGTAGACTGAACATTGGCACCTGATC (SEQ ID NO.7) GTGCCAATTGTCAAGCTAAGTTCAGCAGAGCTTCATTCGATGCTTCCCTCGTTGCTTCCCACTGGGCAGCAAACAACAACCTATGTCTTTCGCTCTTTGACTCATTGTATCTTTCTAACAATCACTGCT ACAATTAGTCCATCCTTCCATCGGTCGCTCTGACAATAAGTACATATTTAGCACGAACAATTCCTCCATCCTACAATTAATACTTAGCTATGACGAAATGGTAGACTGAACATTGGCACCTGATC (SEQ ID NO.8) i) Using the feature information of version one, sequences that conform to version one are screened from the obtained DNA sequence library.

[0046] Sequencing reads the feature information of version one, and after decoding, a Bloom filter is used to filter the sequence list obtained in step h) to obtain the sequence required for version one, SEQ ID NO.1, SEQ ID NO.2, SEQ ID NO.3, SEQ ID NO.4, SEQ ID NO.5, SEQ ID NO.6, SEQ ID NO.7, SEQ ID NO.8.

[0047] j) Using the feature information of version 2, sequences that conform to version 2 are screened from the obtained DNA sequence library.

[0048] Sequencing reads the feature information of version 2, and after decoding, a Bloom filter is used to filter the sequence list obtained in step h) to obtain the required sequences of version 2, SEQ ID NO.1, SEQ ID NO.2, SEQ ID NO.3, SEQ ID NO.4, SEQ ID NO.9, SEQ ID NO.6, SEQ ID NO.7, SEQ ID NO.8.

[0049] k) Convert the DNA sequence information of version 1 and version 2 into binary information, and then restore the two versions of "Shuidiao Getou".

[0050] This completes the process of retrieving information stored in DNA.

Claims

1. A method for storing information in DNA, the method comprising: a) Convert the information file into a first DNA sequence, and divide the first DNA sequence into a first group of oligonucleotide chains; b) Use a Bloom filter to extract features from the first group of oligonucleotide chains and convert the extracted features into a second DNA sequence; or... The first group of oligonucleotide chains is feature-extracted using a Bloom filter, and the extracted features are converted into a second DNA sequence. The second DNA sequence is then segmented into a second group of oligonucleotide chains. c) Synthesize the first set of oligonucleotide chains, and synthesize the second DNA sequence or the second set of oligonucleotide chains; d) Store the synthesized second DNA sequence or second group of oligonucleotide chains separately from the first group of oligonucleotide chains; or The second DNA sequence or the second group of oligonucleotide chains is stored together with the first group of oligonucleotide chains, wherein the second DNA sequence or the second group of oligonucleotide chains carries a marker.

2. According to the method of claim 1, in a), the information file is converted into a binary string through binary information conversion, and the binary string is converted into a string composed of the four characters ACTG through encoding.

3. In the method of claim 2, in a), the encoding conversion method is selected from: Huffman coding, RS coding, Church coding, Grass coding, DNA fountain coding, and Yin-Yang coding.

4. The method of claim 1, wherein adapters are added to the first set of oligonucleotide chains and the second DNA sequence or the second set of oligonucleotide chains, the adapters comprising primers and / or indexers.

5. The method according to any one of claims 1-4, wherein the length of the oligonucleotide chain is 150-400 bp.

6. The method according to any one of claims 1-4, wherein the length of the oligonucleotide chain is 200-300 bp.

7. The method according to any one of claims 1-4, wherein the length of the oligonucleotide chain is 254 bp.

8. A method for modifying DNA storage information stored according to any one of claims 1-7, the method comprising: a) Obtain the updated oligonucleotide chain in the first group of oligonucleotide chains corresponding to the modified information file; b) Use a Bloom filter to extract features from the first group of oligonucleotide chains corresponding to the modified information file and convert the extracted features into a third DNA sequence; or... The first group of oligonucleotide chains corresponding to the modified information file is feature extracted using a Bloom filter, and the extracted features are converted into a third DNA sequence. The third DNA sequence is then segmented into a third group of oligonucleotide chains. c) Synthesize the updated oligonucleotide chain, and synthesize the third DNA sequence or the third group of oligonucleotide chains; d) Combine and store the synthesized updated oligonucleotide chain with the first set of oligonucleotide chains stored as described in claims 1-7; and The synthesized third DNA sequence or third group of oligonucleotide chains may be stored separately; or the third DNA sequence or third group of oligonucleotide chains may be stored together with the first group of oligonucleotide chains, wherein the third DNA sequence or third group of oligonucleotide chains carries a marker.

9. A method for reading DNA storage information modified according to claim 8, the method comprising: e) Sequencing the stored DNA sequence to obtain sequencing sequence information, including: the first set of oligonucleotide chain sequence information, the second DNA sequence information or the second set of oligonucleotide chain sequence information, and the third DNA sequence information or the third set of oligonucleotide chain sequence information; f) Obtain feature information based on the second DNA sequence information or the second group of oligonucleotide chain sequence information, and / or the third DNA sequence information or the third group of oligonucleotide chain sequence information; based on the feature information, use a Bloom filter to screen out the target DNA sequence corresponding to the information file before and / or after modification from the first group of oligonucleotide chain sequences; g) Convert the selected DNA sequences to obtain information files before and / or after modification.

Citation Information

Patent Citations

  • File data backup method based on Delta increment

    CN101650677A

  • Method and system for information sequence feature encoding and retrieval

    CN105955982A