WO2023272499A1

WO2023272499A1 - Encoding method, decoding method, apparatus, terminal device, and readable storage medium

Info

Publication number: WO2023272499A1
Application number: PCT/CN2021/103179
Authority: WO
Inventors: 戴俊彪; 卢明伟; 黄小罗
Original assignee: 中国科学院深圳先进技术研究院
Priority date: 2021-06-29
Filing date: 2021-06-29
Publication date: 2023-01-05

Abstract

An encoding method, a decoding method, an apparatus, a terminal device (12), and a readable storage medium, which are applicable to the technical field of storage. In the encoding method, initial base sequences of data to be encoded can be acquired; the initial base sequences can then be grouped to obtain at least one set of intermediate base sequences corresponding to the initial base sequences, and first preset base sequences the proportions of G and C of which satisfy a preset condition are used to substitute the intermediate base sequences, and an encoded file corresponding to the data is obtained. The encoding method can enable the proportions of G and C in the encoded file to meet requirements, the cost and the probability of error of DNA sequence synthesis and sequencing to be reduced, the cost of DNA storage to be reduced, and the application scale of DNA storage to be expanded.

Description

Encoding method, decoding method, device, terminal equipment and readable storage medium

technical field

The present application belongs to the field of storage technology, and in particular relates to an encoding method, a decoding method, a device, a terminal device, and a computer-readable storage medium.

Background technique

As an information storage medium, deoxyribonucleic acid (DNA) has the characteristics of high storage density, long storage time and low loss rate, and can be used for mass storage of information. In DNA storage technology, the data to be stored needs to be encoded into the base sequence of DNA, and then DNA can be synthesized according to the base sequence to store the data to be stored into the DNA. Among them, DNA encoding technology is the key technology in DNA storage. However, the existing DNA coding technology will increase the probability of errors in the process of DNA synthesis and sequencing, which is not conducive to the wide application of DNA storage technology.

technical problem

One of the purposes of the embodiments of the present application is to provide an encoding method, decoding method, device, terminal equipment, and computer-readable storage medium, which can solve the problem that the existing DNA encoding technology will increase the probability of errors in the process of DNA synthesis and sequencing problems, expanding the scope of application of DNA storage technology.

technical solution

In the first aspect, the embodiment of the present application provides an encoding method, including:

Obtain the initial base sequence of the data to be encoded;

grouping the initial base sequences to obtain at least one group of intermediate base sequences corresponding to the initial base sequences;

Replace at least one set of the intermediate base sequences with a first preset base sequence corresponding to at least one set of the intermediate base sequences to obtain an encoding file corresponding to the data to be encoded, the first preset It is assumed that the ratio of G and C included in the base sequence satisfies a preset condition.

Exemplarily, the data to be encoded is text, and the obtaining the initial base sequence of the data to be encoded includes:

Count the occurrence frequency of each character in the text;

Constructing a quadrangle Huffman tree corresponding to the text with each of the characters as a leaf node and the frequency of occurrence of each of the characters as the weight of the leaf node;

Representing each edge of the four-fork Huffman tree with a base to obtain a code table corresponding to the text;

The initial base sequence corresponding to the text is determined according to the coding table.

Exemplarily, the at least one set of intermediate base sequences is replaced by a first preset base sequence corresponding to at least one set of intermediate base sequences to obtain an encoding file corresponding to the data to be encoded ,include:

replacing at least one set of intermediate base sequences with a first preset base sequence corresponding to at least one set of intermediate base sequences to obtain a target base sequence;

Obtaining repeated bases whose number of consecutive occurrences is equal to a preset number of times in the target base sequence;

The repeated bases are replaced by a second preset base sequence corresponding to the repeated bases to obtain an encoding file corresponding to the data to be encoded.

Specifically, the grouping of the initial base sequences to obtain at least one set of intermediate base sequences corresponding to the initial base sequences includes:

The initial base sequences are grouped according to the first number of bases to obtain at least one group of the intermediate base sequences, and the number of bases included in each of the intermediate base sequences is the first number of bases.

In a possible implementation manner of the first aspect, the method further includes:

Obtaining an individual base sequence in the initial base sequence, wherein the individual base sequence is a base whose number of bases is less than the first number of bases after grouping the initial base sequence sequence;

Determine the number of third bases to be added according to the number of first bases and the number of second bases corresponding to the separate base sequence, and add the third base at a preset position of the separate base sequence base number of bases.

Optionally, adding the third number of bases at the preset position of the individual base sequence includes:

adding the third number of bases at preset positions of the individual base sequence according to the order of GCAT.

Exemplarily, the individual base sequence is the base sequence at the head of the initial base sequence or the base sequence at the tail of the initial base sequence.

Exemplarily, the preset position is the head or the end of the single base sequence.

In a possible implementation manner of the first aspect, at least one set of the intermediate base sequences is replaced by the first preset base sequence corresponding to at least one set of the intermediate base sequences to obtain The encoding file corresponding to the data to be encoded includes:

Replace at least one set of the intermediate base sequences with the first preset base sequence corresponding to at least one set of the intermediate base sequences one-to-one, and merge the replaced intermediate base sequence with the separate base sequence , to obtain the target base sequence;

Optionally, the preset number of times is 4, and the correspondence between the repeated bases and the second preset base sequence includes at least one of the following:

GCATG corresponds to GGGG;

GCATC corresponds to CCCC;

GCATA corresponds to AAAA;

GCATT corresponds to TTTT.

Exemplary, the method also includes:

constructing a first sequence set corresponding to the intermediate base sequence according to the number of first bases corresponding to the intermediate base sequence;

determining a fourth base number corresponding to the first preset base sequence according to the first base number;

The second sequence set corresponding to the first preset base sequence is constructed according to the fourth base number, and the G and C contained in each of the first preset base sequences in the second sequence set The proportion satisfies the preset conditions;

Establishing a correspondence between each of the intermediate base sequences in the first sequence set and each of the first preset base sequences in the second sequence set.

Optionally, the number of the first bases is 5, and the number of the fourth bases is 6.

In the second aspect, the embodiment of the present application provides a decoding method, including:

Obtaining a file to be decoded, the file to be decoded is a file encoded based on the encoding method described in any one of the above first aspects;

performing base reduction on the file to be decoded to obtain an initial base sequence corresponding to the file to be decoded;

Decoding the initial base sequence to obtain decoded data corresponding to the file to be decoded.

Through the above decoding method, the bases of the files to be decoded whose GC ratio meets the preset conditions can be accurately restored to obtain the initial base sequence corresponding to the file to be decoded, and by decoding the initial base sequence, you can get The decoding data corresponding to the file to be decoded can effectively improve decoding efficiency and correctness.

Exemplarily, the base reduction of the file to be decoded is performed to obtain the initial base sequence corresponding to the file to be decoded, including:

Obtain the second preset base sequence in the file to be decoded;

replacing the second preset base sequence with repeated bases corresponding to the second preset base sequence to obtain a target base sequence corresponding to the file to be decoded;

Obtaining the first preset base sequence in the target base sequence;

replacing the first preset base sequence with an intermediate base sequence corresponding to the first preset base sequence to obtain an initial base sequence corresponding to the file to be decoded.

In a third aspect, the embodiment of the present application provides an encoding device, including:

The initial sequence acquisition module is used to obtain the initial base sequence of the data to be encoded;

A sequence grouping module, configured to group the initial base sequences to obtain at least one set of intermediate base sequences corresponding to the initial base sequences;

An encoding module, configured to replace at least one set of intermediate base sequences with a first preset base sequence corresponding to at least one set of intermediate base sequences to obtain an encoding file corresponding to the data to be encoded, The ratio of G and C contained in the first preset base sequence satisfies a preset condition.

In a fourth aspect, the embodiment of the present application provides a decoding device, including:

A file acquisition module, configured to acquire a file to be decoded, where the file to be decoded is a file encoded based on the encoding method described in any one of the above first aspects;

A base restoration module, configured to perform base restoration on the file to be decoded to obtain an initial base sequence corresponding to the file to be decoded;

A decoding module, configured to decode the initial base sequence to obtain decoded data corresponding to the file to be decoded.

In the fifth aspect, the embodiment of the present application provides a terminal device, including a memory, a processor, and a computer program stored in the memory and operable on the processor, when the processor executes the computer program Realize the above-mentioned first aspect, or the method described in any one of the second aspect.

In the sixth aspect, the embodiment of the present application provides a computer-readable storage medium, the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the above-mentioned first aspect or the second aspect are implemented. any one of the methods described.

In a seventh aspect, an embodiment of the present application provides a computer program product, which, when the computer program product is run on a terminal device, enables the terminal device to execute the method described in any one of the first aspect or the second aspect.

Beneficial effect

The beneficial effect of the encoding method provided by the embodiment of the present application is that: through the above-mentioned encoding method, the initial base sequence of the data to be encoded can be obtained, and the initial base sequence can be grouped to obtain an intermediate base sequence. Then, the intermediate base sequence can be replaced with the first preset base sequence whose GC ratio meets the preset conditions, so that the GC ratio contained in the obtained encoding file meets the requirements, reducing the cost of DNA sequence synthesis and sequencing And the probability of error, reduce the cost of DNA storage, and expand the application scale of DNA storage.

Description of drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the accompanying drawings that need to be used in the descriptions of the embodiments or the prior art will be briefly introduced below. Obviously, the accompanying drawings in the following description are only for the present application For some embodiments, those of ordinary skill in the art can also obtain other drawings based on these drawings without any creative effort.

FIG. 1 is a schematic flow chart of an encoding method provided in Embodiment 1 of the present application;

FIG. 2 is a schematic diagram of a scene for constructing a four-fork Huffman tree provided by Embodiment 1 of the present application;

Fig. 3 is a schematic diagram of the application scenario of adding bases provided in Embodiment 1 of the present application;

FIG. 4 is a schematic diagram of a scene of an encoding method provided in Embodiment 1 of the present application;

FIG. 5 to FIG. 7 are schematic diagrams showing the effect of the encoding method provided in Embodiment 1 of the present application;

FIG. 8 is a schematic flowchart of a decoding method provided in Embodiment 2 of the present application;

FIG. 9 is a schematic diagram of a scene of a decoding method provided in Embodiment 2 of the present application;

FIG. 10 is a schematic structural diagram of an encoding device provided in Embodiment 3 of the present application;

FIG. 11 is a schematic structural diagram of a decoding device provided in Embodiment 4 of the present application;

FIG. 12 is a schematic structural diagram of a terminal device provided by an embodiment of the present application.

Embodiments of the present invention

In the following description, specific details such as specific system structures and technologies are presented for the purpose of illustration rather than limitation, so as to thoroughly understand the embodiments of the present application. It will be apparent, however, to one skilled in the art that the present application may be practiced in other embodiments without these specific details. In other instances, detailed descriptions of well-known systems, devices, circuits, and methods are omitted so as not to obscure the description of the present application with unnecessary detail.

It should be understood that when used in this specification and the appended claims, the term "comprising" indicates the presence of described features, integers, steps, operations, elements and/or components, but does not exclude one or more other Presence or addition of features, wholes, steps, operations, elements, components and/or collections thereof.

It should also be understood that the term "and/or" used in the description of the present application and the appended claims refers to any combination and all possible combinations of one or more of the associated listed items, and includes these combinations.

As used in this specification and the appended claims, the term "if" may be construed, depending on the context, as "when" or "once" or "in response to determining" or "in response to detecting ". Similarly, the phrase "if determined" or "if [the described condition or event] is detected" may be construed, depending on the context, to mean "once determined" or "in response to the determination" or "once detected [the described condition or event] ]” or “in response to detection of [described condition or event]”.

In addition, in the description of the specification and appended claims of the present application, the terms "first", "second", "third" and so on are only used to distinguish descriptions, and should not be understood as indicating or implying relative importance.

Reference to "one embodiment" or "some embodiments" or the like in the specification of the present application means that a particular feature, structure, or characteristic described in connection with the embodiment is included in one or more embodiments of the present application. Thus, appearances of the phrases "in one embodiment," "in some embodiments," "in other embodiments," "in other embodiments," etc. in various places in this specification are not necessarily All refer to the same embodiment, but mean "one or more but not all embodiments" unless specifically stated otherwise. The terms "including", "comprising", "having" and variations thereof mean "including but not limited to", unless specifically stated otherwise.

Relevant data show that the total amount of global data information will increase to 163 Zettabytes (ZB) in 2025, which exceeds the capacity of storage media such as existing hard disks. Therefore, it is very important to find a new data storage . As an information storage medium, DNA has the characteristics of high storage density, long storage time, and low loss rate. It can be used for mass storage of information and has gradually attracted widespread attention from researchers. Among them, DNA has four bases, namely Guanine (Guanine, G), Cytosine (Cytosine, C), Adenine (Adenine, A) and Thymine (Thymine, T). In DNA storage technology, the data to be stored needs to be encoded into a base sequence consisting of four bases of GCAT, and then DNA is synthesized according to the base sequence to store the data to be stored in DNA.

Among them, DNA encoding technology is the key technology in DNA storage. However, the existing DNA coding technology has the problems of low coding efficiency or uneven GC ratio in the encoded base sequence and multi-base repetition, which increases the cost of DNA sequence synthesis and sequencing and the probability of errors, which is not conducive to DNA Large-scale application of storage technology. It should be understood that sequencing is a necessary operation before decoding the encoded encoded file, and is used to measure the DNA base sequence corresponding to the encoded file. After the base sequence is obtained, the base sequence is decoded according to the decoding rules.

In order to solve the above problems, the embodiment of the present application provides an encoding method for encoding data into base sequences in DNA, so as to use DNA for data storage. In this method, after obtaining the initial base sequence of the data to be encoded, the initial base sequence can be grouped to obtain at least one group of intermediate base sequences corresponding to the initial base sequence, and the proportions of G and C are used to satisfy the preset The first preset base sequence of the condition replaces each intermediate base sequence to obtain an encoding file corresponding to the data to be encoded. That is, the encoding method provided by the embodiment of the present application can make the proportion of GC in the encoding file meet the requirements, reduce the cost of DNA sequence synthesis and sequencing and the probability of errors, reduce the cost of DNA storage, and expand the application scale of DNA storage. ease of use and practicality.

The encoding method and decoding method provided in the embodiments of the present application can be applied to mobile phones, tablet computers, wearable devices, vehicle-mounted devices, augmented reality (augmented reality, AR)/virtual reality (virtual reality, VR) devices, notebook computers, super mobile On terminal devices such as personal computers (ultra-mobile personal computer, UMPC), netbooks, and personal digital assistants (personal digital assistants, PDAs), the embodiments of the present application do not impose any restrictions on the specific types of terminal devices.

[Example 1]

Please refer to FIG. 1 . FIG. 1 shows a schematic flowchart of an encoding method provided in Embodiment 1 of the present application. As shown in Figure 1, the method may include:

S101. The terminal device acquires the initial base sequence of the data to be encoded.

Wherein, the data to be encoded may be data in any format, such as text, numbers, and so on. In the embodiment of the present application, the terminal device can encode the data to be encoded in any format according to any existing encoding method to obtain the initial base sequence of the data to be encoded, which is not specifically limited in the embodiment of the present application.

In order to make the final encoded file have a shorter base sequence, to improve the encoding efficiency and reduce the cost of DNA storage, the terminal device can treat the encoded data through the four-fork Huffman encoding (that is, the four-ary Huffman encoding) method Encoding is performed to obtain the initial base sequence. The following will take the quadrangle Huffman coding as an example for illustration.

Exemplarily, when the data to be encoded is text, the terminal device may first perform word segmentation processing on the text to obtain each character corresponding to the text. Then, the terminal device counts the number of occurrences of each character in the text, so that the frequency of occurrence of each character can be determined according to the number of occurrences of each character and the total number of characters in the text, and each character is used as a leaf node. For the weight of the leaf node, construct a quadruple Huffman tree corresponding to the text. Subsequently, the terminal device can represent each edge of the quadruplet Huffman tree with bases to obtain a coding table corresponding to the text, so that the initial base sequence of the text can be determined according to the coding table.

It can be understood that the terminal device can select the four leaf nodes with the smallest weights to construct the first-level quadrangle Huffman subtree, and the weight of the root node of the quadrature Huffman subtree is the weight of the four leaf nodes The sum of the weights of . Then, the terminal device determines the root node of the quadruplet Huffman subtree as a new leaf node, and continues from all unselected leaf nodes (including the root node of the quadruplet Huffman subtree of the first layer) Select the four leaf nodes with the smallest weight to build the second layer of quadruplet Huffman subtree, the weight of the root node of the quadrangle Huffman subtree is the sum of the weights of these four leaf nodes, as By analogy, until it is no longer possible to construct a four-fork Huffman subtree, to obtain a four-fork Huffman tree corresponding to the text.

Wherein, the number n of root nodes in the four-fork Huffman tree corresponding to the text can be determined according to the quotient of the total number of characters w1 and 3 corresponding to the text. When the total number of characters w1 is an integer multiple of 3, then n is the quotient obtained by dividing the total number of characters w1 by 3, for example, when the total number of characters w1 is 12, n is 4; when the total number of characters w1 is not an integer of 3 When times, then n is the quotient obtained by dividing the total number of characters w1 by 3 plus 1, for example, when the total number of characters w1 is 8, n is 3. It can be understood that the relationship between the number of leaf nodes w2 and n required to construct a quadrangle Huffman tree must satisfy 3n+1=w2. Therefore, when the total number of characters w1 of the text is not equal to w2, the terminal device can add one or two leaf nodes with a weight of 0 to construct a quadrangle Huffman tree.

After constructing the quadrature Huffman tree corresponding to the text, the terminal device can set bases for each side of the constructed quadrature Huffman tree respectively. Specifically, for each quadruple Huffman subtree, the terminal device can set the four sides of the quadruple Huffman subtree as "G", "C", "A" in order from left to right ", "T". Then, the terminal device can determine the combination of all bases on the path from the root node of the quadruplet Huffman tree to the leaf node corresponding to each character as the base corresponding to the character in order from left to right, and obtain the text The corresponding coding table, so that the initial base sequence of the text can be determined according to the coding table.

Please refer to FIG. 2 . FIG. 2 shows a schematic diagram of an application scenario for constructing a quad-fork Huffman tree provided by Embodiment 1 of the present application. In this application scenario, the text "Biology and Synthetic Biology" is taken as an example to illustrate the construction of a quadruple Huffman tree.

As shown in Figure 2, the terminal device can first perform word segmentation processing on the text to obtain the characters "生", "物", "和", "合", "成" and "学", and can be based on the occurrence of each character in the text The number of times and the total number of characters determine the frequency of occurrence of each character, and the frequency of occurrence of "生" is 0.25, the frequency of "thing" is 0.25, the frequency of "and" is 0.125, and the frequency of "combination" is 0.125. The frequency of occurrence of "cheng" is 0.125, and the frequency of "learning" is 0.125. Subsequently, the terminal device uses each character as a leaf node, and uses the frequency of occurrence of each character as the weight of the leaf node to construct a quadruplet Huffman tree. Among them, since the total number of characters corresponding to the text (w1=8) is less than the number of leaf nodes (w2=9) required to construct a quadrangle Huffman tree, the terminal device can determine the leaf nodes to be added according to w2 and w1 The number is 1. At this time, the terminal device can add a leaf node with a weight of 0 to construct a quadruple Huffman tree as shown in FIG. 2 . The numbers 1, 0.25, 0, etc. in Figure 2 represent the weight of the node.

Then, the terminal device can set the four sides of all four-fork Huffman subtrees as "G", "C", "A", and "T" in order from left to right, and according to the four-fork Huffman The combination of all bases on the path from the root node of the Mann tree (the node where "1" is located in Figure 2) to the leaf node corresponding to each character is determined as the base corresponding to the character, and the following table 1 is obtained code table. According to the coding table, the terminal device can determine that the initial base sequence of "Biology and Synthetic Biology" is CATCTATTCAG.

Table 1

字符character	生pregnancy	物thing	与and	合combine	成become	学study
碱基base	CC	AA	TCTC	TATA	TTTT	GG

S102. The terminal device groups the initial base sequences to obtain at least one group of intermediate base sequences corresponding to the initial base sequences.

Exemplarily, the terminal device may group the initial base sequences according to the first number of bases to obtain at least one group of intermediate base sequences, that is, each intermediate base sequence may include bases of the first number of bases. Wherein, the first number of bases can be any value greater than or equal to 5. In the embodiment of the present application, in order to make the final encoding file have a shorter base sequence and improve encoding efficiency, the first number of bases can be determined as 5.

S103. The terminal device replaces at least one set of intermediate base sequences with the first preset base sequence corresponding to at least one set of intermediate base sequences to obtain an encoding file corresponding to the data to be encoded, the first preset base sequence The ratio of G and C contained in satisfies the preset condition.

Exemplarily, the terminal device may first determine the first preset base sequence corresponding to each intermediate base sequence according to the first preset correspondence relationship, and replace the corresponding intermediate base sequence with each first preset base sequence, The target base sequence is obtained, and the target base sequence includes each intermediate base sequence after replacement. Then, the terminal device can obtain the repeated bases whose consecutive occurrences are equal to the preset number of times in the target base sequence, and can obtain the second preset base sequence corresponding to the repeated bases according to the second preset correspondence relationship, so as to utilize the second The preset base sequence will repeat the base replacement to obtain the encoding file corresponding to the data to be encoded.

Wherein, the second preset correspondence between repeated bases and the second preset base sequence includes at least one of the following: GCATG corresponds to GGGG; GCATC corresponds to CCCC; GCATA corresponds to AAAA; GCATT corresponds to TTTT. It should be understood that the second preset correspondence relationship may be stored in the terminal device, or may be stored in other devices such as a cloud server communicatively connected with the terminal device.

Similarly, the first preset correspondence can be stored in the terminal device, or can be stored in other devices such as a cloud server communicatively connected with the terminal device, and the first preset correspondence can be pre-established by the terminal device, or can be created by the cloud The server and other devices are pre-established, which is not specifically limited in this embodiment of the present application. The following will take an example in which the first preset correspondence is pre-established by the terminal device as an example for illustration.

Specifically, the terminal device may construct the first sequence set corresponding to the intermediate base sequence according to the first base number corresponding to the intermediate base sequence. Wherein, the first sequence set may include all possible arrangements of base sequences with a base number of 5, therefore, the first sequence set may include 45=1024 intermediate base sequences, that is, the first sequence set may Including {GGGGG, GGAGG, GCGGG, GCAGG, GAGGG, GAAGG, GTGGG, GTAGG, CGGGG, CGAGG, ...} a total of 1024 intermediate base sequences.

Subsequently, the terminal device may determine a fourth base number corresponding to the first preset base sequence according to the first base number. Wherein, the fourth base number can be any value. In the embodiment of this application, in order to ensure that the GC ratio in the final encoding file meets the requirements, the cost of DNA sequence synthesis and sequencing and the probability of errors are reduced, and at the same time, in order to make the encoding file have a shorter base sequence, to improve For coding efficiency, the number of fourth bases can be determined as 6. Hereinafter, the fourth base number is 6 as an example for illustration.

Similarly, the terminal device can construct a third sequence set containing the first preset base sequence according to the fourth base number, wherein the ratio of G and C contained in each base sequence in the third sequence set satisfies the preset set conditions. Here, the preset condition may be that the proportion of GC is 50%, that is, the total number of G and C contained in each base sequence in the third sequence set is half of the number of the fourth base (ie 3). It should be understood that there are a total of 1280 possible arrangements of base sequences with a base number of 6 and a GC ratio of 50%, that is, the third sequence set may include {GGGAAA, GGGAAT, GGGATA, GGGATT, GGGTAA, GGGTAT, GGGTTA, GGGTTT, GGCAAA, GGCAAT, ...} have a total of 1280 base sequences.

Since the base sequence containing GCAT needs to be used in the subsequent repeated base replacement, in order to reduce the error probability in decoding, that is, to avoid the decoding process, the first preset base sequence is misjudged as being used to replace repeated bases The second preset base sequence, which is incorrectly decoded into GGGG, CCCC, AAAA or TTTT, the terminal device can delete GCATxx, xGCATx, xxGCAT, xxxGCA, xxxxGC and CATxxx in the third sequence set to ensure that the second The second preset base sequences GCATG, GCATC, GCATA and GCATT for replacing repeated bases will not appear in the sequence set. x is an arbitrary base, and x described below is an arbitrary base.

In addition, since the number of bases will be increased in repeated base replacement, in order to make the encoding file have a shorter base sequence and reduce the cost of DNA storage, the terminal device can also delete GGGxxx, CCCxxx, AAAxxx in the third sequence set , TTTxxx, xxxGGG, xxxCCC, xxxAAA, xxxTTT, xGGGAA, and xGGGTT to reduce the probability of four base repeats in the target base sequence, thereby reducing the length of the base sequence corresponding to the encoding file.

After the above-mentioned deletion process, there are 1091 base sequences remaining in the third sequence set. At this time, the terminal device can select 1024 base sequences from the 1091 base sequences as the first preset base sequence to obtain Second set of sequences {GGCAAT, GGCTAA, GGCTAT, GGCTTA, GGAGAA, GGAGAT, GGAGTA, GGAGTT, GGACAA, GGACAT, ...}. Then, the terminal device can regard the first sequence set and the second sequence set as a 1x1024-dimensional matrix respectively, and combine the two matrices into a 2x1024-dimensional matrix M:

Wherein, the first row in the matrix M is each intermediate base sequence in the first sequence set, and the second row is each first preset base sequence in the second sequence set. At this time, the terminal device can correspond (1, a) in the matrix M to (2, a) in the matrix M, so as to establish the relationship between each intermediate base sequence in the first sequence set and the second sequence set Correspondence between each first preset base sequence. a is any column in the matrix M. That is to say, when the intermediate base sequence is GGGGG in (1,1), the first predetermined base sequence corresponding to the intermediate base sequence is GGCAAT in (2,1). When the intermediate base sequence is GGGCG in (1,5), the first predetermined base sequence corresponding to the intermediate base sequence is GGAGAA in (2,5).

In this embodiment, after using the first preset base sequence to replace the corresponding intermediate base sequence to obtain the target base sequence, when the target base sequence does not contain the above-mentioned repeated bases, the terminal device does not need to use the second The preset relationship is used to replace repeated bases, and the target base sequence is directly determined as the encoding file corresponding to the data to be encoded.

In a possible implementation, when the number of bases corresponding to the initial base sequence is not an integer multiple of the first base number, when the terminal device groups the initial base sequences to obtain at least one set of intermediate base sequences, it also A single base sequence can be obtained, and the number of second bases corresponding to the single base sequence is less than the number of first bases, that is, the single base sequence can contain 1 base, 2 bases, 3 bases or 4 bases base. Therefore, after the intermediate base sequence is replaced according to the first preset correspondence, the terminal device can combine the replaced intermediate base sequence with the individual base sequence to obtain the target base sequence. It should be understood that the terminal device can combine the intermediate base sequence and the individual base sequence according to the positional relationship between the two in the initial base sequence. Then, the terminal device can obtain the repeated bases whose consecutive occurrences are equal to the preset number of times in the target base sequence, and can obtain the second preset base sequence corresponding to the repeated bases according to the second preset correspondence relationship, so as to utilize the second The preset base sequence replaces the repeated bases to obtain the encoding file corresponding to the data to be encoded.

In another possible implementation, the terminal device can determine the number of third bases to be added according to the number of first bases and the number of second bases corresponding to the individual base sequence, and can Assume that the position is added according to the order of GCAT to add the base of the third base number, and the individual base sequence after the base addition and the intermediate base sequence after the replacement are merged to obtain the target base sequence, and the added The base is used as the recognition sequence, so that during the decoding process, the terminal device can accurately identify the individual base sequence according to the recognition sequence, thereby accurately obtaining the decoded file and improving the correctness of decoding. For example, when four bases need to be added, the terminal device can add "G", "C", "A", and "T" in sequence from left to right in the preset position of the individual base sequence. For example, when three bases need to be added, the terminal device can add "G", "C", and "A" in sequence from left to right in the preset position of the individual base sequence. For example, when two bases need to be added, the terminal device can add "G" and "C" in sequence from left to right in the preset position of the individual base sequence. For example, when a base needs to be added, the terminal device can add "G" at the preset position of the individual base sequence, and so on.

It should be noted that the individual base sequence can be the base sequence at any position in the initial base sequence, for example, it can be the base sequence at the head of the initial base sequence, or it can be the base sequence at the tail of the initial base sequence sequence, or it can be the base sequence at any position in the middle of the initial base sequence. In addition, the preset position for adding bases may be the head or the end of a single base sequence.

Please refer to FIG. 3 . FIG. 3 shows a schematic diagram of an application scenario for adding bases provided in Embodiment 1 of the present application. As shown in (a) in 3, the individual base sequence can be the base sequence at the head of the initial base sequence, and the terminal device can add bases with the third number of bases at the head of the individual base sequence; or, As shown in (b) in FIG. 3 , the individual base sequence may be the base sequence at the end of the initial base sequence, and the terminal device may add a third number of bases at the end of the individual base sequence.

In order to facilitate the correct identification of the individual base sequence during the decoding process, the terminal device can mark the position of the individual base sequence in the initial base sequence and the preset position of the added base in the individual base sequence. , the terminal device can identify the individual base sequence according to the mark. In this embodiment, in order to reduce the length of the final encoded file, improve encoding efficiency, reduce decoding difficulty and error probability, the terminal device may not set a flag, but directly set the individual base sequence as the end of the initial base sequence by default base sequence, and directly set the preset position of the added base in the separate base sequence as the end of the separate base sequence by default.

The following will take the example that the number of the first base is 5, the number of the fourth base is 6, the single base sequence defaults to the base sequence at the end of the initial base sequence, and the preset position defaults to the end of the single base sequence sexual description.

Please refer to FIG. 4 , which shows a schematic diagram of an application scenario of the encoding method provided in Embodiment 1 of the present application. As shown in Figure 4, when determining that the initial base sequence of the data to be encoded is CCTCTATCCAG, the terminal device can base on the second number of bases corresponding to the initial base sequence (i.e. 11) and the preset first number of bases (i.e. 5) Grouping the initial base sequences to obtain two intermediate base sequences (ie CCTCT and ATCCA) and an individual base sequence, wherein the individual base sequence includes a base G. Then, the terminal device can add four bases "G", "C", "A", and "T" to the end of the individual base sequence to obtain GGCAT. At the same time, the terminal device can use the first preset base sequence corresponding to each intermediate base sequence to replace each intermediate base sequence, for example, use the first preset base sequence CCTGAA corresponding to the intermediate base sequence CCTCT to replace the intermediate base sequence base sequence CCTCT, using the first preset base sequence AACGTC corresponding to the intermediate base sequence ATCCA to replace the intermediate base sequence ATCCA, and merging the replaced base sequence CCTGAAAACGTC and GGCAT to obtain the target base sequence CCTGAAAACGTCGGCAT. Then, the terminal device can obtain the repeated base AAAA in the target base sequence CCTGAAAACGTCGGCAT, and use the second preset base sequence GCATA corresponding to the repeated base AAAA to replace the repeated base AAAA to obtain the encoding file corresponding to the data to be encoded CCTGGCATACGTCGGCAT.

The effect of the encoding method provided in this embodiment will be illustrated below by taking the full text of "San Zi Jing" as an example.

Referring to FIG. 5 to FIG. 7 , FIG. 5 to FIG. 7 show schematic diagrams of effects of the encoding method provided by Embodiment 1 of the present application. As shown in Figure 5, in the encoded file obtained by encoding the full-text text of "San Zi Jing" using the three-pronged Huffman encoding (i.e., ternary Huffman encoding) method, there are more The GC ratio of the sequence is lower than 0.45 or higher than 0.55. As shown in Figure 6, compared with the three-pronged Huffman encoding, in the encoding file obtained by encoding the full-text text of "San Zi Jing" using the encoding method proposed in Example 1 of the present application, in any continuous 50bp base sequence The GC ratios are all between 0.45 and 0.55. Obviously, the encoding method provided in Embodiment 1 of the present application can make the GC ratios in the encoded files more uniform. In addition, in the encoding file obtained by using the encoding method provided in Example 1 of the present application, the maximum number of repeated bases in the base sequence is 3. In summary, the encoding method provided in Example 1 of the present application is more conducive to reducing the difficulty of synthesizing long DNA fragment sequences, thereby effectively reducing the probability of errors during DNA synthesis and sequencing, and expanding the application range of DNA storage technology.

As shown in Figure 7, the base sequence in the encoding file obtained by encoding using the encoding method proposed in Example 1 of the present application is 9793bp, while the length of the base sequence in the encoding file obtained by using the three-pronged Huffman encoding is 10128bp, That is, the length of the base sequence obtained by the encoding method provided in Example 1 of the present application is shorter, which is more conducive to reducing the cost of DNA storage information.

In this embodiment, after obtaining the initial base sequence of the data to be encoded, the initial base sequence can be grouped to obtain at least one group of intermediate base sequences corresponding to the initial base sequence, and the proportions of G and C can be used to The first preset base sequence that meets the preset conditions replaces the intermediate base sequence to obtain an encoding file corresponding to the data to be encoded. That is, the encoding method provided in this embodiment can make the GC ratio in the encoding file meet the requirements, reduce the cost of DNA sequence synthesis and sequencing and the probability of errors, expand the application scale of DNA storage, and have strong usability and practicality sex.

[Example 2]

Please refer to FIG. 8. FIG. 8 shows a schematic flowchart of a decoding method provided in Embodiment 2 of the present application. As shown in FIG. 8, the method may include:

S801. The terminal device acquires a file to be decoded, where the file to be decoded is a file encoded based on the encoding method described in Embodiment 1 above.

S802. The terminal device performs base restoration on the file to be decoded to obtain an initial base sequence corresponding to the file to be decoded.

S803. The terminal device decodes the initial base sequence to obtain decoded data corresponding to the file to be decoded.

Specifically, the terminal device can first obtain the second preset base sequence in the file to be decoded, and use the repeated bases corresponding to the second preset base sequence to replace the second preset base sequence to obtain the file to be decoded Corresponding target base sequence. Then, the terminal device can obtain the first preset base sequence in the target base sequence, and use the intermediate base sequence corresponding to the first preset base sequence to replace the first preset base sequence to obtain the file to be decoded Corresponding initial base sequence. Subsequently, the terminal device can decode the initial base sequence to obtain the decoded data corresponding to the file to be decoded. Wherein, in this embodiment, the decoding method for the terminal device to decode the initial base sequence corresponds to the encoding method for encoding the data to be encoded to obtain the initial base sequence in Embodiment 1.

Exemplarily, when the data to be encoded is text, the terminal device may encode the text by using quad-fork Huffman encoding to obtain an encoding table corresponding to the text. Then, the terminal device can determine the initial base sequence of the text according to the coding table. Therefore, when decoding, the terminal device can decode the initial base sequence according to the encoding table to obtain the corresponding decoded data (that is, the text). The following will take four-fork Huffman coding as an example for illustration.

Wherein, the correspondence between repeated bases and the second preset base sequence may include GCATG corresponding to GGGG; GCATC corresponding to CCCC; GCATA corresponding to AAAA; GCATT corresponding to TTTT. That is, the terminal device can look for "GCATT" in the file to be decoded and replace it with "TTTT", look for "GCATA" and replace it with "AAAA", look for "GCATC" and replace it with "CCCC", and look for " GCATG" and replace it with "GGGG" to get the target base sequence corresponding to the file to be decoded. It should be understood that the specific content of the corresponding relationship between the first preset base sequence and the intermediate base sequence can refer to the description in the first embodiment above, and will not be repeated here.

Exemplarily, during the encoding process, when grouping the initial base sequence, if there is a separate base sequence, the terminal device can add the first identification and the second identification corresponding to the encoding file, the first identification is used to identify the individual base The position of the base sequence in the initial base sequence, and the second mark is used to identify the preset position of the added base in the separate base sequence.

After obtaining the target base sequence, the terminal device can split the individual base sequence (including the added base) from the target base sequence according to the first identification and the second identification corresponding to the file to be decoded, and delete the individual base sequence. A base added to a base sequence. For the remaining base sequences in the target base sequence (that is, base sequences other than the individual base sequences), the terminal device can obtain the first preset base sequence, and use the intermediate base corresponding to the first preset base sequence The base sequence replaces the first preset base sequence, and merges the base sequence obtained by base replacement with the single base sequence after base deletion to obtain the initial base sequence corresponding to the file to be encoded. Subsequently, the terminal device can decode the initial base sequence according to the encoding table corresponding to the four-fork Huffman encoding, and obtain the decoded data corresponding to the file to be decoded.

Alternatively, the terminal device may first split the individual base sequence (including the added bases) from the file to be decoded according to the first identifier and the second identifier, and delete the added bases in the individual base sequence. Then, for the remaining base sequences in the file to be decoded (i.e. base sequences other than the individual base sequences), the terminal device can obtain the second preset base sequence in the remaining base sequences, and use the The repeated bases corresponding to the preset base sequence are replaced by the second preset base sequence to obtain the target base sequence corresponding to the file to be decoded. The terminal device obtains the first preset base sequence in the target base sequence, replaces the first preset base sequence with the intermediate base sequence corresponding to the first preset base sequence, and performs base replacement to obtain The base sequence is merged with the single base sequence after base deletion to obtain the initial base sequence corresponding to the file to be encoded. Subsequently, the terminal device can decode the initial base sequence according to the encoding table corresponding to the four-fork Huffman encoding, and obtain the decoded data corresponding to the file to be decoded.

In a possible implementation, during the encoding process, the terminal device can default the individual base sequence as the base sequence at the end of the initial base sequence, and place the added base at the preset position of the individual base sequence The default is the end of the individual base sequence, so as to facilitate the accurate identification of the individual base sequence during decoding without introducing an identifier, so as to ensure correct decoding data. Therefore, after obtaining the target base sequence, the terminal device can obtain the number of bases corresponding to the target base sequence. When the number of bases corresponding to the target base sequence is a multiple of 6, the terminal device can directly use the intermediate base sequence corresponding to each first preset base sequence to perform base reduction on the first preset base sequence , that is, restore every 6 bases to the original 5 bases, and obtain the initial base sequence corresponding to the file to be decoded. Wherein, the sequence in which the terminal device performs base reduction is the same as the sequence in which the terminal device performs base replacement in Embodiment 1. For example, when in Embodiment 1, the terminal device performs base replacement in order from left to right, in this embodiment, the terminal device will perform base restoration in order from left to right. The following will take restoration from left to right as an example for illustration.

When the number of bases corresponding to the target base sequence is not a multiple of 6, the terminal device can split the last 5 base sequences in the target base sequence, and can base the split base sequence Deleted to obtain a single base sequence. At the same time, the terminal device can use the intermediate base sequence corresponding to each first preset base sequence to perform base reduction on the first preset base sequence, that is, restore every 6 bases to the original 5 bases . Then, the terminal device can combine the individual base sequence with the base sequence obtained by base reduction, that is, add the individual base sequence to the end of the base sequence obtained by base reduction to obtain the initial base corresponding to the file to be decoded sequence.

Among them, during the encoding process, the terminal device can perform base addition at the end of the individual base sequence in the order of "GCAT". When decoding, when the last group of base sequences is xxxxG, the terminal device can determine that G is the added base, that is, it can determine that the individual base sequence is xxxx. When the last group of base sequences is xxxGC, the terminal device can determine that G and C are the added bases, that is, the individual base sequence can be determined as xxx. When the last group of base sequences is xxGCA, the terminal device can determine that G, C and A are the added bases, that is, it can determine that the individual base sequence is xx. When the last group of base sequences is xGCAT, the terminal device can determine that G, C, A and T are the added bases, that is, the individual base sequence can be determined as x.

Please refer to FIG. 9, which shows a schematic diagram of an application scenario of the decoding method provided in this embodiment. As shown in Figure 9, when the file to be decoded obtained by the terminal device is CACTTGAACCACGGCAT, since GCATG, GCATC, GCATA, and GCATT do not exist in the file to be decoded, the terminal device can determine that there is no four-base repeat problem in the file to be decoded , at this point the terminal device can directly determine the file to be decoded as the target base sequence. Since the number of bases corresponding to the target base sequence is not a multiple of 6, the terminal device can determine that there is a separate base sequence in the target base sequence. At this time, the terminal device can split the target base sequence to obtain separate The base sequence GGCAT and the first preset base sequences CACTTG and AACCAC. Subsequently, the terminal device can use the intermediate base sequence CATCT corresponding to the first preset base sequence CACTTG to replace the first preset base sequence CACTTG, and the intermediate base sequence AATTCA corresponding to the first preset base sequence AACCAC to replace The first preset base sequence AACCAC, at the same time, the terminal device can delete the added base GCAT in the single base sequence GGCAT. Finally, the terminal device can combine the first preset base sequence after base substitution and the individual base sequence after base deletion to obtain the initial base sequence CATCTATTCAG, and according to Table 1 in the foregoing embodiment one Decode the initial base sequence using the coding table shown, and obtain the decoded data "Biology and Synthetic Biology" corresponding to the file to be decoded.

In another possible implementation, during the encoding process, the terminal device may not add bases to the individual base sequence, but directly default the individual base sequence as the base sequence at the end of the initial base sequence. During the decoding process, when the number of bases corresponding to the target base sequence is not a multiple of 6, the terminal device can obtain the remainder of the number of bases corresponding to the target base sequence and 6, and split it from the end of the target base sequence The base sequence of the remainder is used as a single base sequence. At the same time, the terminal device can use the intermediate base sequence corresponding to each first preset base sequence to restore the first preset base sequence, that is, the base after splitting the individual base sequence from the target base sequence Every 6 bases in the base sequence are restored to the original 5 bases. Then, the terminal device can combine the individual base sequence with the base sequence obtained through base reduction to obtain the initial base sequence corresponding to the file to be decoded.

Through the above decoding method, the terminal device can perform base restoration on the file to be decoded according to the preset corresponding relationship, and obtain the initial base sequence corresponding to the file to be decoded. Then, the initial base sequence can be decoded according to the coding table constructed in advance to obtain the decoding data corresponding to the file to be decoded, so as to improve decoding efficiency and correctness.

It should be understood that the sequence numbers of the steps in the above embodiments do not mean the order of execution, and the execution order of each process should be determined by its function and internal logic, and should not constitute any limitation to the implementation process of the embodiment of the present application.

[Embodiment 3]

Corresponding to the encoding method described in the first embodiment above, Fig. 10 shows a structural block diagram of the encoding device provided by the third embodiment of the present application. part.

Referring to Figure 10, the encoding device may include:

An initial sequence acquisition module 1001, configured to acquire an initial base sequence of the data to be encoded;

A sequence grouping module 1002, configured to group the initial base sequences to obtain at least one set of intermediate base sequences corresponding to the initial base sequences;

An encoding module 1003, configured to replace at least one set of intermediate base sequences with a first preset base sequence corresponding to at least one set of intermediate base sequences to obtain an encoding file corresponding to the data to be encoded , the ratio of G and C contained in the first preset base sequence satisfies a preset condition.

Exemplarily, the data to be encoded is text, and the initial sequence acquisition module 1001 may include:

A frequency statistics unit, configured to count the frequency of occurrence of each character in the text;

A Huffman tree construction unit, configured to use each of the characters as a leaf node, and use the frequency of occurrence of each of the characters as the weight of the leaf node to construct a quadruplet Huffman tree corresponding to the text;

An encoding table acquisition unit, configured to represent each edge of the quadrupled Huffman tree with a base to obtain an encoding table corresponding to the text;

The initial sequence determination unit is configured to determine the initial base sequence corresponding to the text according to the coding table.

In a possible implementation manner, the encoding module 1003 may include:

The first replacement unit is used to replace at least one set of the intermediate base sequences with a first preset base sequence corresponding to at least one set of the intermediate base sequences to obtain the target base sequence;

The first repeated base obtaining unit is used to obtain repeated bases whose consecutive occurrences are equal to the preset number of times in the target base sequence;

The second replacement unit is configured to replace the repeated bases with a second preset base sequence corresponding to the repeated bases to obtain an encoding file corresponding to the data to be encoded.

Specifically, the sequence grouping module 1002 is specifically configured to group the initial base sequences according to the first number of bases to obtain at least one set of intermediate base sequences, and the bases included in each intermediate base sequence The number of bases is the first number of bases.

In a possible implementation manner, the device may further include:

An individual sequence acquisition module, configured to acquire an individual base sequence in the initial base sequence, wherein, after grouping the initial base sequence, the number of bases obtained is less than that of the first base sequence A base sequence of one base number;

A base adding module, configured to determine the number of third bases to be added according to the number of first bases and the number of second bases corresponding to the separate base sequence, and Positions add the third number of bases.

Optionally, the base addition module is further configured to add bases of the third base number at preset positions of the individual base sequence according to the order of GCAT.

In a possible implementation manner, the encoding module 1003 may further include:

The third replacement unit is used to replace at least one set of the intermediate base sequences with the first preset base sequence corresponding to at least one set of the intermediate base sequences, and replace the replaced intermediate base sequences Merge with a separate base sequence to obtain the target base sequence;

The second repetitive base obtaining unit is used to obtain repeated bases whose consecutive occurrence times are equal to a preset number of times in the target base sequence;

The fourth replacement unit is configured to replace the repeated bases with a second preset base sequence corresponding to the repeated bases to obtain an encoding file corresponding to the data to be encoded.

Wherein, the preset number of times is 4 times, and the correspondence between the repeated base and the second preset base sequence includes at least one of the following:

GCATG corresponds to GGGG;

GCATC corresponds to CCCC;

GCATA corresponds to AAAA;

GCATT corresponds to TTTT.

Exemplarily, the device may also include:

A first set construction module, configured to construct a first sequence set corresponding to the intermediate base sequence according to the number of first bases corresponding to the intermediate base sequence;

A base number determination module, configured to determine a fourth base number corresponding to the first preset base sequence according to the first base number;

A second set construction module, configured to construct a second sequence set corresponding to the first preset base sequence according to the fourth base number, each of the first preset bases in the second sequence set The ratio of G and C included in the sequence meets the preset condition;

A correspondence relationship establishment module, configured to establish a correspondence relationship between each of the intermediate base sequences in the first sequence set and each of the first preset base sequences in the second sequence set.

[Example 4]

Corresponding to the decoding method described in Embodiment 2 above, FIG. 11 shows a structural block diagram of the decoding device provided in Embodiment 4 of the present application. For the convenience of description, only the components related to Embodiment 4 of the present application are shown in FIG. 11 . part.

Referring to Figure 11, the decoding device may include:

A file obtaining module 1101, configured to obtain a file to be decoded, the file to be decoded is a file obtained by encoding based on the encoding method described in any one of the first embodiment above;

A base restoration module 1102, configured to perform base restoration on the file to be decoded to obtain an initial base sequence corresponding to the file to be decoded;

The decoding module 1103 is configured to decode the initial base sequence to obtain decoded data corresponding to the file to be decoded.

Exemplarily, the base reduction module 1102 may include:

a first base determination unit, configured to obtain a second preset base sequence in the file to be decoded;

a first reduction unit, configured to replace the second preset base sequence with repeated bases corresponding to the second preset base sequence, to obtain a target base sequence corresponding to the file to be decoded;

a sequence obtaining unit, configured to obtain a first preset base sequence in the target base sequence;

The second restoring unit is configured to use an intermediate base sequence corresponding to the first preset base sequence to replace the first preset base sequence to obtain an initial base sequence corresponding to the file to be decoded.

It should be noted that the information interaction and execution process between the above-mentioned devices/units are based on the same concept as the method embodiment of the present application, and its specific functions and technical effects can be found in the method embodiment section. I won't repeat them here.

Those skilled in the art can clearly understand that for the convenience and brevity of description, only the division of the above-mentioned functional units and modules is used for illustration. In practical applications, the above-mentioned functions can be assigned to different functional units, Completion of modules means that the internal structure of the device is divided into different functional units or modules to complete all or part of the functions described above. Each functional unit and module in the embodiment may be integrated into one processing unit, or each unit may exist separately physically, or two or more units may be integrated into one unit, and the above-mentioned integrated units may adopt hardware It can also be implemented in the form of software functional units. In addition, the specific names of the functional units and modules are only for the convenience of distinguishing each other, and are not used to limit the protection scope of the present application. For the specific working process of the units and modules in the above system, reference may be made to the corresponding process in the foregoing method embodiments, and details will not be repeated here.

FIG. 12 is a schematic structural diagram of a terminal device provided by an embodiment of the present application. As shown in FIG. 12 , the terminal device 12 of this embodiment includes: at least one processor 1200 (only one is shown in FIG. 12 ), a memory 1201 and stored in the memory 1201 and can be used in the at least one processor 1200 A computer program 1202 running on the computer, when the processor 1200 executes the computer program 1202, the steps in any of the foregoing text encoding method embodiments or text decoding method embodiments are implemented.

The terminal device 12 may be a computing device such as a desktop computer, a notebook, or a palmtop computer. The terminal device may include, but not limited to, a processor 1200 and a memory 1201. Those skilled in the art can understand that FIG. 12 is only an example of the terminal device 12, and does not constitute a limitation on the terminal device 12. It may include more or less components than those shown in the figure, or combine certain components, or different components. , for example, may also include input and output devices, network access devices, and so on.

The processor 1200 can be a central processing unit (central processing unit, CPU), and the processor 1200 can also be other general processors, digital signal processors (digital signal processor, DSP), application specific integrated circuits (application specific integrated circuits) , ASIC), field-programmable gate array (field-programmable gate array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor, or the processor may be any conventional processor, or the like.

The storage 1201 may be an internal storage unit of the terminal device 12 in some embodiments, such as a hard disk or a memory of the terminal device 12 . The memory 1201 may also be an external storage device of the terminal device 12 in other embodiments, such as a plug-in hard disk equipped on the terminal device 12, a smart memory card (smart media card, SMC), a secure digital (secure digital, SD) card, flash memory card (flash card), etc. Further, the memory 1201 may also include both an internal storage unit of the terminal device 12 and an external storage device. The memory 1201 is used to store operating systems, application programs, bootloader programs (BootLoader), data and other programs, such as program codes of the computer programs. The memory 1201 can also be used to temporarily store data that has been output or will be output.

The embodiment of the present application also provides a computer-readable storage medium, where the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps in the foregoing method embodiments can be implemented.

An embodiment of the present application provides a computer program product. When the computer program product runs on a terminal device, the terminal device can implement the steps in the foregoing method embodiments when executed.

If the integrated unit is realized in the form of a software function unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, all or part of the procedures in the methods of the above embodiments in the present application can be completed by instructing related hardware through computer programs, and the computer programs can be stored in a computer-readable storage medium. The computer program When executed by a processor, the steps in the above-mentioned various method embodiments can be realized. Wherein, the computer program includes computer program code, and the computer program code may be in the form of source code, object code, executable file or some intermediate form. The computer-readable storage medium may at least include: any entity or device capable of carrying computer program codes to the device/terminal device, recording medium, computer memory, read-only memory (read-only memory, ROM, ), random access Memory (random access memory, RAM), electrical carrier signals, telecommunication signals, and software distribution media. Such as U disk, mobile hard disk, magnetic disk or optical disk, etc. In some jurisdictions, computer readable storage media may not be electrical carrier signals and telecommunication signals based on legislation and patent practice.

In the above-mentioned embodiments, the descriptions of each embodiment have their own emphases, and for parts that are not detailed or recorded in a certain embodiment, refer to the relevant descriptions of other embodiments.

Those skilled in the art can appreciate that the units and algorithm steps of the examples described in conjunction with the embodiments disclosed herein can be implemented by electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are executed by hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art may use different methods to implement the described functions for each specific application, but such implementation should not be regarded as exceeding the scope of the present application.

In the embodiments provided in this application, it should be understood that the disclosed apparatus/terminal device and method may be implemented in other ways. For example, the device/terminal device embodiments described above are only illustrative. For example, the division of the modules or units is only a logical function division. In actual implementation, there may be other division methods, such as multiple units Or components may be combined or may be integrated into another system, or some features may be omitted, or not implemented. In another point, the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces, and the indirect coupling or communication connection of devices or units may be in electrical, mechanical or other forms.

The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place, or may be distributed to multiple network units. Part or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

The above-described embodiments are only used to illustrate the technical solutions of the present application, rather than to limit them; although the present application has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: it can still implement the foregoing embodiments Modifications to the technical solutions described in the examples, or equivalent replacements for some of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the various embodiments of the application, and should be included in the Within the protection scope of this application.

Claims

An encoding method, characterized in that it comprises:

Obtain the initial base sequence of the data to be encoded;

grouping the initial base sequences to obtain at least one group of intermediate base sequences corresponding to the initial base sequences;

Replace at least one set of the intermediate base sequences with a first preset base sequence corresponding to at least one set of the intermediate base sequences to obtain an encoding file corresponding to the data to be encoded, the first preset It is assumed that the ratio of G and C included in the base sequence satisfies a preset condition.
The method according to claim 1, wherein the data to be encoded is text, and the obtaining the initial base sequence of the data to be encoded comprises:

Count the occurrence frequency of each character in the text;

Constructing a quadrangle Huffman tree corresponding to the text with each of the characters as a leaf node and the frequency of occurrence of each of the characters as the weight of the leaf node;

Representing each edge of the four-fork Huffman tree with a base to obtain a code table corresponding to the text;

The initial base sequence of the text is determined according to the coding table.
The method according to claim 1, characterized in that, replacing at least one set of the intermediate base sequences with a first preset base sequence corresponding to at least one set of the intermediate base sequences to obtain The encoding file corresponding to the data to be encoded includes:

replacing at least one set of intermediate base sequences with a first preset base sequence corresponding to at least one set of intermediate base sequences to obtain a target base sequence;

Obtaining repeated bases whose number of consecutive occurrences is equal to a preset number of times in the target base sequence;

The repeated bases are replaced by a second preset base sequence corresponding to the repeated bases to obtain an encoding file corresponding to the data to be encoded.
The method according to claim 1, wherein the grouping of the initial base sequences to obtain at least one group of intermediate base sequences corresponding to the initial base sequences comprises:

The initial base sequences are grouped according to the first number of bases to obtain at least one group of the intermediate base sequences, and the number of bases included in each of the intermediate base sequences is the first number of bases.
The method of claim 4, further comprising:

Obtaining an individual base sequence in the initial base sequence, wherein the individual base sequence is a base whose number of bases is less than the first number of bases after grouping the initial base sequence sequence;

Determine the number of third bases to be added according to the number of first bases and the number of second bases corresponding to the separate base sequence, and add the third base at a preset position of the separate base sequence base number of bases.
The method according to claim 5, wherein said adding the third number of bases at the preset position of said individual base sequence comprises:

adding the third number of bases at preset positions of the individual base sequence according to the order of GCAT.
The method according to claim 5, wherein the single base sequence is a base sequence at the head of the initial base sequence or a base sequence at the tail of the initial base sequence.
The method according to claim 5, wherein the preset position is the head or the end of the single base sequence.
The method according to any one of claims 5 to 8, wherein said at least one group of said intermediate base sequences is converted into a The base sequence is replaced to obtain the encoding file corresponding to the data to be encoded, including:

Replace at least one set of the intermediate base sequences with the first preset base sequence corresponding to at least one set of the intermediate base sequences one-to-one, and merge the replaced intermediate base sequence with the separate base sequence , to obtain the target base sequence;

Obtaining repeated bases whose number of consecutive occurrences is equal to a preset number of times in the target base sequence;

The repeated bases are replaced by a second preset base sequence corresponding to the repeated bases to obtain an encoding file corresponding to the data to be encoded.
The method according to claim 9, wherein the preset number of times is 4, and the correspondence between the repeated base and the second preset base sequence includes at least one of the following:

GCATG corresponds to GGGG;

GCATC corresponds to CCCC;

GCATA corresponds to AAAA;

GCATT corresponds to TTTT.
The method according to any one of claims 1 to 8, wherein said method further comprises:

constructing a first sequence set corresponding to the intermediate base sequence according to the number of first bases corresponding to the intermediate base sequence;

determining a fourth base number corresponding to the first preset base sequence according to the first base number;

The second sequence set corresponding to the first preset base sequence is constructed according to the fourth base number, and the G and C contained in each of the first preset base sequences in the second sequence set The proportion satisfies the preset conditions;

Establishing a correspondence between each of the intermediate base sequences in the first sequence set and each of the first preset base sequences in the second sequence set.
The method according to claim 11, wherein the number of the first bases is 5, and the number of the fourth bases is 6.
A decoding method, characterized in that, comprising:

Obtaining a file to be decoded, the file to be decoded is a file encoded based on the encoding method described in any one of claims 1 to 12;

performing base reduction on the file to be decoded to obtain an initial base sequence corresponding to the file to be decoded;

Decoding the initial base sequence to obtain decoded data corresponding to the file to be decoded.
The method according to claim 13, wherein said performing base reduction on said file to be decoded to obtain an initial base sequence corresponding to said file to be decoded comprises:

Obtain the second preset base sequence in the file to be decoded;

replacing the second preset base sequence with repeated bases corresponding to the second preset base sequence to obtain a target base sequence corresponding to the file to be decoded;

Obtaining the first preset base sequence in the target base sequence;

replacing the first preset base sequence with an intermediate base sequence corresponding to the first preset base sequence to obtain an initial base sequence corresponding to the file to be decoded.
An encoding device, characterized in that it comprises:

The initial sequence acquisition module is used to obtain the initial base sequence of the data to be encoded;

A sequence grouping module, configured to group the initial base sequences to obtain at least one set of intermediate base sequences corresponding to the initial base sequences;

An encoding module, configured to replace at least one set of intermediate base sequences with a first preset base sequence corresponding to at least one set of intermediate base sequences to obtain an encoding file corresponding to the data to be encoded, The ratio of G and C contained in the first preset base sequence satisfies a preset condition.
A decoding device, characterized in that it comprises:

A file acquisition module, configured to acquire a file to be decoded, the file to be decoded is a file encoded based on the encoding method described in any one of claims 1 to 12;

A base restoration module, configured to perform base restoration on the file to be decoded to obtain an initial base sequence corresponding to the file to be decoded;

A decoding module, configured to decode the initial base sequence to obtain decoded data corresponding to the file to be decoded.
A terminal device, comprising a memory, a processor, and a computer program stored in the memory and operable on the processor, characterized in that, when the processor executes the computer program, the following claims 1 to 1 are implemented. 12, or the method described in any one of 13 to 14.
A computer-readable storage medium, the computer-readable storage medium stores a computer program, characterized in that, when the computer program is executed by a processor, the computer program according to any one of claims 1 to 12 or 13 to 14 is implemented. described method.