Gene sequence non-alignment method, device and electronic device
By converting gene sequences into amino acid sequences and constructing feature vectors using the k-mer model, the problems of long computation time and low accuracy in genome evolution analysis are solved, achieving more efficient and accurate genome evolution analysis.
Patent Information
- Application Number
- CN202210051329.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-01-17
- Publication Date
- 2024-11-12
- Estimated Expiration
- 2042-01-17
AI Technical Summary
In existing technologies, when gene sequences are divided into multiple base strings, feature vectors are directly constructed based on the frequency of each base string. This results in excessively long computation time and low accuracy in genome evolution analysis.
The reference gene sequence is converted into the target amino acid sequence by using a pre-defined non-alignment principle, and the target k-mer feature vector of the target amino acid sequence is determined by using a pre-defined k-mer model to construct a developmental tree.
The length of the amino acid sequence was reduced, the computation time was decreased, and the accuracy of the developmental tree and the efficiency of genome evolution analysis were improved by obtaining the target k-mer feature vector without alignment.
Smart Images

Figure CN114429784B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of genome evolution analysis, and in particular to a gene sequence non-comparison method, device and electronic equipment. Background Art
[0002] Genome evolution analysis has always been an important issue in bioinformatics research. Constructing phylogenetic trees through genome evolution analysis helps people understand the evolutionary history of organisms.
[0003] In the related technology, the frequency of all consecutive k-base strings in the gene sequence is first determined based on the traditional k-mer algorithm, and then the frequency is used to form a feature vector to calculate the feature vector of each gene sequence in the gene sequence data set. Then, multiple feature vectors are used to calculate the Euclidean distance between every two gene sequences, and finally an evolutionary tree is constructed based on the distance matrix.
[0004] However, since the related art directly constructs a feature vector based on the frequency of each base string when dividing the gene sequence into multiple base strings, the operation of genome evolution analysis takes too long and has low accuracy. Summary of the invention
[0005] The present invention provides a gene sequence non-alignment method, device and electronic device, which are used to solve the defects of the prior art that when a gene sequence is divided into multiple base strings, a feature vector is directly formed based on the frequency of each base string, resulting in a long operation time and low accuracy of genome evolution analysis, and achieve the purpose of improving the efficiency and accuracy of genome evolution analysis through a non-alignment genome classification method.
[0006] The present invention provides a gene sequence non-alignment method, comprising:
[0007] Based on a preset non-alignment principle, converting the reference gene sequence into a target amino acid sequence; wherein the preset non-alignment principle is used to divide the reference gene sequence into target base groups and determine the target amino acid sequence based on the target base groups;
[0008] Determine a target k-mer feature vector of the target amino acid sequence based on a preset k-mer model; wherein the preset k-mer model is used to determine the target k-mer feature vector based on the frequency of k consecutive target amino acids in the target amino acid sequence;
[0009] According to the target k-mer feature vector, a distance matrix of the reference gene sequence is determined to construct a developmental tree.
[0010] According to a gene sequence non-alignment method provided by the present invention, the reference gene sequence is converted into a target amino acid sequence based on a preset non-alignment principle, comprising:
[0011] Obtaining a reference gene sequence, wherein the reference gene sequence includes n bases;
[0012] Based on the preset non-alignment principle, each of the m consecutive bases in the n bases is converted into a target base group, thereby obtaining a target amino acid sequence including a plurality of the target base groups; wherein n and m are integers greater than 1 respectively and n>m.
[0013] According to a gene sequence non-alignment method provided by the present invention, based on a preset non-alignment principle, each of the n bases is converted into a target base group, thereby obtaining a target amino acid sequence including a plurality of the target base groups, comprising:
[0014] Based on a preset non-alignment principle, the n bases are divided into n-2 target base groups; wherein each of the n-2 target base groups includes m consecutive bases and the n-2 first bases of the n-2 target base groups are consecutive, and n is an integer greater than 2;
[0015] Based on the n-2 target base groups, a target amino acid sequence including the n-2 target base groups is determined; wherein the target amino acid sequence includes n-2 target amino acids and each of the target amino acids represents a target base group.
[0016] According to a gene sequence non-alignment method provided by the present invention, before the step of determining a target k-mer feature vector of the target amino acid sequence based on a preset k-mer model, the method further comprises:
[0017] Get the parameter k value;
[0018] Determine the preset k-mer model corresponding to the parameter k value.
[0019] According to a gene sequence non-alignment method provided by the present invention, the process of obtaining the parameter k value includes:
[0020] Based on the value range Get the parameter k value; where [·] means · is a closed interval, represents rounding down, log represents logarithmic operation, min represents the length of the shortest gene sequence in the gene sequence database, p represents the number of amino acid types, and q represents a positive integer greater than 0.
[0021] According to a gene sequence non-alignment method provided by the present invention, when the number of the reference gene sequences is multiple, determining the distance matrix of the reference gene sequences according to the target k-mer feature vector to construct a developmental tree includes:
[0022] Calculating the Euclidean distance between different target k-mer feature vectors;
[0023] According to the Euclidean distance, a distance matrix of the plurality of reference gene sequences is determined.
[0024] The present invention also provides a gene sequence non-comparison device, comprising:
[0025] A conversion module, used to convert the reference gene sequence into a target amino acid sequence based on a preset non-alignment principle; wherein the preset non-alignment principle is used to divide the reference gene sequence into target base groups and determine the target amino acid sequence based on the target base groups;
[0026] A determination module, based on a preset k-mer model, determines a target k-mer feature vector of the target amino acid sequence; wherein the preset k-mer model is used to determine the target k-mer feature vector based on the frequency of k consecutive target amino acids in the target amino acid sequence;
[0027] The processing module is used to determine the distance matrix of the reference gene sequence according to the target k-mer feature vector to construct a developmental tree.
[0028] The present invention also provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the steps of any of the above-mentioned gene sequence non-alignment methods are implemented.
[0029] The present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of any of the above-mentioned gene sequence non-alignment methods.
[0030] The present invention also provides a computer program product, comprising a computer program, wherein when the computer program is executed by a processor, the steps of any of the above-mentioned gene sequence non-alignment methods are implemented.
[0031] The present invention provides a gene sequence non-alignment method, device and electronic device, wherein the gene sequence non-alignment method first converts a reference gene sequence into a target amino acid sequence based on a preset non-alignment principle. Since the preset non-alignment principle is used to divide the reference gene sequence into target base groups and determine the target amino acid sequence based on the target base groups, the length of the target amino acid sequence can be reduced, and the operation time is reduced; further, a target k-mer feature vector of the target amino acid sequence is determined based on a preset k-mer model; since the preset k-mer model is used to determine the target k-mer feature vector based on the frequency of k consecutive target amino acids in the target amino acid sequence, the target k-mer feature vector of the target amino acid sequence can be obtained without alignment, so that when a developmental tree is subsequently constructed by determining the distance matrix of the reference gene sequence through the target k-mer feature vector, the accuracy of the developmental tree can be greatly improved, thereby effectively improving the efficiency and accuracy of genome evolution analysis. BRIEF DESCRIPTION OF THE DRAWINGS
[0032] In order to more clearly illustrate the technical solutions in the present invention or the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.
[0033] Figure 1 It is a schematic diagram of the process of the non-alignment method of gene sequence provided by the present invention;
[0034] Figure 2 It is a schematic diagram of the verification result of the construction development tree provided by the present invention;
[0035] Figure 3 is a schematic diagram of the types of amino acids that may appear after the amino acid T provided by the method of the present invention;
[0036] Figure 4 is a comparison curve diagram of the relationship between the number of k-mer species and the k value provided by the present invention;
[0037] Figure 5 It is a schematic diagram of the structure of the gene sequence non-comparison device provided by the present invention;
[0038] Figure 6 It is a structural schematic diagram of the electronic device provided by the present invention. DETAILED DESCRIPTION
[0039] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution of the present invention will be clearly and completely described below in conjunction with the drawings of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0040] Genome evolution analysis is an important issue in bioinformatics research. Traditional research uses alignment-based methods, but alignment methods are time-consuming and require large amounts of memory for analysis of large data sets. Therefore, people are paying more and more attention to non-alignment methods.
[0041] The non-alignment method closest to the method of the present invention is the "classical k-mer method". The specific steps of using the classical k-mer method for non-alignment are:
[0042] (1) For the gene sequence S = s1s2,…,s n (s i ∈{A,T,C,G},i=1,2,…,n), calculate the frequency of all consecutive k-strings (k-mers) in the gene sequence, k is a positive integer, generally k=ceil(log4max), max represents the length of the longest gene sequence in the gene sequence data set, ceil represents the rounding operation, and log represents the logarithmic operation; for example, set the first gene sequence S1=ATCTCG, when k=2, S1 has a total of 5 2-mers, namely AT, TC, CT, TC, CG, and the frequencies of AT, CT, and CG are all 1, and the frequency of TC is 2.
[0043] (2) The frequency is used to construct the feature vector. The feature vector of S1 is (1,1,1,2). The order of elements in the feature vectors of different gene sequences should remain consistent.
[0044] (3) Calculate the feature vectors of all gene sequences in the gene sequence data set, and use the feature vectors to calculate the Euclidean distance between every two gene sequences. Suppose another gene sequence is S2 = ATCTCA, then the feature vector calculation process of S1 and S2 is as follows:
[0045]
[0046]
[0047] (4) Calculate the Euclidean distance between all gene sequences and substitute the Euclidean distance matrix into the molecular evolution genetic analysis software to construct an evolutionary tree.
[0048] Through the alignment method and the process of using the classic k-mer method for non-alignment, it can be seen that the alignment-based method takes too long to calculate, and the classic k-mer method also has the disadvantages of long calculation time and low accuracy.
[0049] Based on the above problems, the present invention provides a gene sequence non-comparison method, the execution subject of the gene sequence non-comparison method can be a gene sequence non-comparison device, and the gene sequence non-comparison device can be implemented as part or all of a terminal device by software, hardware, or a combination of software and hardware. Optionally, the terminal device can be a personal computer (PC), a portable device, a laptop computer, a smart phone, a tablet computer, a portable wearable device, and other electronic devices. The present invention does not limit the specific form of the terminal device.
[0050] It should be noted that the execution subject of the following method embodiment may be part or all of the above terminal device. The following method embodiment is described by taking the execution subject as the terminal device as an example.
[0051] Figure 1 A schematic diagram of the process of the non-alignment method of gene sequence provided by the present invention is shown in FIG. Figure 1 As shown, the gene sequence non-alignment method comprises the following steps:
[0052] Step 110: Based on a preset non-alignment principle, convert the reference gene sequence into a target amino acid sequence.
[0053] The preset non-alignment principle is used to divide the reference gene sequence into target base groups and determine the target amino acid sequence based on the target base groups; and the reference gene sequence may be a gene sequence in a gene sequence database.
[0054] Specifically, the terminal device can convert the reference gene sequence using a preset non-matching principle to obtain a target amino acid sequence that is shorter than the reference gene sequence, thereby achieving the purpose of reducing the calculation time by shortening the length of the reference gene sequence.
[0055] Step 120: Determine a target k-mer feature vector of the target amino acid sequence based on a preset k-mer model.
[0056] The preset k-mer model is used to determine the target k-mer feature vector based on the frequency of k consecutive target amino acids in the target amino acid sequence.
[0057] Specifically, for the target amino acid in the target amino acid sequence, the frequency of each k target amino acid in the target amino acid sequence is first determined based on the preset k-mer model, and then the target k-mer feature vector of the target amino acid sequence is further determined based on the frequency of each k target amino acid. For example, when the target amino acid sequence includes 10 target amino acids RDISQSAQKA and k=4, each 4 target amino acids are RDIS, DISQ, ISQS, SQSA, QSAQ, SAQK and AQKA, and the frequencies of RDIS, DISQ, ISQS, SQSA, QSAQ, SAQK and AQKA are 1 respectively, then the target k-mer feature vector of the target amino acid sequence is (1,1,1,1,1,1,1).
[0058] Step 130: Determine the distance matrix of the reference gene sequence according to the target k-mer feature vector to construct a developmental tree.
[0059] Specifically, when there are multiple reference gene sequences, step 130 can be specifically as follows: based on the methods of steps 110 and 120, the corresponding target amino acid sequence is determined for each reference gene sequence, and the target k-mer feature vector of each target amino acid sequence is determined, and then the Euclidean distance between different target k-mer feature vectors is calculated, and then the distance matrix of multiple reference gene sequences is further determined based on the Euclidean distance, thereby constructing a developmental tree.
[0060] In the actual processing process, in order to verify the effectiveness and advantages of the method of the present invention, four different reference gene sequences were used, and the four different reference gene sequences were novel coronavirus (SARS-CoV-2), bacteria (Bacteria), hepatitis C virus (Hepatitis C virus, HCV) and human rhinovirus (Human RhinoVirus, HRV), the method of the present invention and the traditional Muscle sequence alignment method can be used to construct a developmental tree. When the parameter k value is different and the reference gene sequence is different, the method of the present invention and the traditional Muscle sequence alignment method can have different running times. For example, for SARS-CoV-2, when the parameter k value is 4, the running time of the method of the present invention is 14.97 seconds, and when the parameter k value is 7, the running time of the method of the present invention is 77.02 seconds; for Bacteria, when the parameter k value is 2, the running time of the method of the present invention is 272.18 seconds, and when the parameter k value is 9, the running time of the method of the present invention is 30.62 minutes; for HCV, when the parameter k value is 4, the running time of the method of the present invention is 18.72 seconds, and when the parameter k value is 6, the running time of the method of the present invention is 4 3.88 seconds; for HRV, when the parameter k value is 2, the running time of the method of the present invention is 1.72 seconds, and when the parameter k value is 6, the running time of the method of the present invention is 57.19 seconds; but for SARS-CoV-2, regardless of whether the parameter k value is 4 or 7, the running time of the traditional Muscle sequence alignment method is too long and cannot be counted; for Bacteria, regardless of whether the parameter k value is 2 or 9, the running time of the traditional Muscle sequence alignment method is too long and cannot be counted; for HCV, regardless of whether the parameter k value is 4 or 6, the running time of the traditional Muscle sequence alignment method will exceed 30 minutes; for HRV, regardless of whether the parameter k value is 2 or 6, the running time of the traditional Muscle sequence alignment method will also exceed 30 minutes; Based on this, it can be obtained as follows Figure 2 The verification results shown in Figure 2 In the figure, (a) is a schematic diagram of the result when the traditional method is used to construct a developmental tree, and (b) is a schematic diagram of the result when the method of the present invention is used to construct a developmental tree. Figure 2 It can be seen that the results obtained by using the method of the present invention are obviously more specific and accurate than those obtained by using the traditional muscle sequence alignment method, with higher precision and better effect.
[0061] The gene sequence non-alignment method provided by the present invention first converts a reference gene sequence into a target amino acid sequence based on a preset non-alignment principle. Since the preset non-alignment principle is used to divide the reference gene sequence into target base groups and determine the target amino acid sequence based on the target base groups, the length of the target amino acid sequence can be reduced, and the operation time is reduced; further, a target k-mer feature vector of the target amino acid sequence is determined based on a preset k-mer model; since the preset k-mer model is used to determine the target k-mer feature vector based on the frequency of k consecutive target amino acids in the target amino acid sequence, the target k-mer feature vector of the target amino acid sequence can be obtained without alignment, so that when a developmental tree is subsequently constructed in a manner of determining a distance matrix of the reference gene sequence through the target k-mer feature vector, the accuracy of the developmental tree can be greatly improved, thereby effectively improving the efficiency and accuracy of genome evolution analysis.
[0062] Optionally, step 110 may be implemented by the following process:
[0063] First, a reference gene sequence is obtained, wherein the reference gene sequence includes n bases; then, based on a preset non-alignment principle, each of the n consecutive m bases in the n reference genes is converted into a target base group, thereby obtaining a target amino acid sequence including a plurality of the target base groups; wherein n and m are respectively integers greater than 1 and n>m.
[0064] Specifically, when the terminal device obtains the reference gene sequence, it can first determine that its length is n and the n bases are s1s2,…,s i ,…,s n ,s i ∈{A,T,C,G}, i=1,2,…,n; then, replace n bases s1s2,…,s i ,…,s n Every m consecutive bases s i s i+1 ,…,s m-1+i Convert to the i'th target base group That is to say The initial value of i' is 1, and the value of i' is increased by 1 each time a target base group is determined; when the value of i is traversed from 1 to n, a target amino acid sequence including multiple target base groups can be determined.
[0065] It should be noted that each target base group can be a target amino acid, so each target base group i'=1,2,…,n-2.
[0066] The gene sequence non-alignment method provided by the present invention can quickly achieve the purpose of obtaining a target amino acid sequence with a shortened length by converting each of the n bases included in the reference gene sequence into a target base group. Not only is the conversion method simple and easy to operate, but it can also further reduce the calculation time.
[0067] Optionally, based on the preset non-alignment principle, each of the n bases is converted into a target base group, thereby obtaining a target amino acid sequence including a plurality of the target base groups, including:
[0068] First, based on a preset non-alignment principle, the n bases are divided into n-2 target base groups; wherein each of the n-2 target base groups includes m consecutive bases and the n-2 first bases of the n-2 target base groups are consecutive, and n is an integer greater than 2; then, based on the n-2 target base groups, a target amino acid sequence including the n-2 target base groups is determined; wherein the target amino acid sequence includes n-2 target amino acids and each of the target amino acids represents a target base group.
[0069] Specifically, set n=12, and the 12 bases included in the reference gene sequence are s1s2s3s4s5s6s7s8s9s 10 s 11 s 12 and s1s2s3s4s5s6s7s8s9s 10 s 11 s 12 =CGATCAGCAAGC, each base is a nucleotide, then, when m=3, each of the 12 bases can be used to form a codon, that is, based on the preset non-alignment principle, s1s2s3=CGA can be converted into the first target base group P1 and the first target base group P1 can be recorded as the first target amino acid P1=R, s2s3s4=GAT can be converted into the second target base group P2 and the second target base group P2 can be recorded as the second target amino acid D, and s3s4s5=ATC can be converted into The third target base group P3 is converted into I, s4s5s6=TCA is converted into the fourth target base group P4 and the fourth target base group P4 is recorded as S, s5s6s7=CAG is converted into the fifth target base group P5 and the fifth target base group P5 is recorded as Q, s6s7s8=AGC is converted into the sixth target base group P6 and the sixth target base group P6 is recorded as S, s7s8s9=GCA is converted into the seventh target base group P7 and the seventh target base group P7 is recorded as A, s8s9s 10=CAA is converted into the 8th target base group P8 and the 8th target base group P8 is recorded as Q, and s9s 10 s 11 =AAG is converted into the 9th target base group P9 and the 9th target base group P9 is recorded as K, and s 10 s 11 s 12 =AGC converted to the 10th target base group P 10 And the 10th target base group P 10 Denoted as S, among the 10 target base groups at this time, the first base of the first target base group is C, the first base of the second target base group is G, the first base of the third target base group is A, the first base of the fourth target base group is T, the first base of the fifth target base group is C, the first base of the sixth target base group is A, the first base of the seventh target base group is G, the first base of the eighth target base group is C, the first base of the ninth target base group is A, and the first base of the tenth target base group is A, so the 10 first bases of the 10 target base groups are continuous; and the target amino acid sequence obtained at this time includes P1P2P3P4P5P6P7P8P9P 10 These 10 target base groups can be recorded as the target amino acid sequence, that is, P1P2P3P4P5P6P7P8P9P 10 =RDISQSAQKA, it can be seen that the target amino acid sequence is 2 bases shorter than the reference gene sequence. Therefore, the target amino acid sequence can be considered as a specific amino acid sequence, and each target amino acid in the target amino acid sequence can be a specific amino acid.
[0070] It should be noted that the conversion process of the method of the present invention is different from the transcription and translation process in biology, and the difference lies in the number of nucleotides moved each time.
[0071] The gene sequence non-alignment method provided by the method of the present invention divides the n bases in the reference gene sequence into n-2 target base groups based on a preset non-alignment principle. Since each of the n-2 target base groups includes m consecutive bases and the n-2 first bases of the n-2 target base groups are consecutive, the target amino acid sequence including n-2 target amino acids determined based on the n-2 target base groups is more reliable, which greatly reduces the dimension of the feature vector, thereby providing a strong basis for the subsequent construction of an accurate developmental tree.
[0072] Optionally, before step 120, the method further includes:
[0073] First, a parameter k value is obtained; then, a preset k-mer model corresponding to the parameter k value is determined.
[0074] Specifically, the process of obtaining the parameter k value includes: based on the value range Get the parameter k value; where [·] means · is a closed interval, represents rounding down, log represents logarithmic operation, min represents the length of the shortest gene sequence in the gene sequence database; p represents the number of amino acid species and its value can be 20; q represents a positive integer greater than 0 and its value is 2. Furthermore, when determining the parameter k value, the preset k-mer model can be determined, thereby greatly improving the operation efficiency.
[0075] The gene sequence non-alignment method provided by the present invention not only improves the flexibility and reliability of determining the preset k-mer model, but also provides a guarantee for the reliability and accuracy of subsequent determination of the target gene sequence by first obtaining the parameter k value and then determining the preset k-mer model corresponding to the parameter k value, thereby avoiding the defects of the prior art that the operation of genome evolution analysis is too long and the accuracy is low due to directly using the length of the longest gene sequence in the gene sequence database to determine the k value, thereby further improving the efficiency and accuracy of genome evolution analysis.
[0076] It should be noted that the main goal of the method of the present invention is to develop a unique unmatched genome classification technology, which can be called the nucleotide-amino acid k-mer vector (NAAKV) method. The NAAKV method obtains correct evolutionary results on whole genome datasets, including SARS-CoV-2, dengue virus (DENV), human papilloma virus (HPV), HCV, HRV and hepatitis B virus (HBV). One of the most important findings is that the parameter k value used in the method of the present invention is usually very small (for example, the parameter k value ranges from 2 to 4). The smaller k value greatly reduces the memory requirement during calculation and significantly improves the calculation efficiency.
[0077] Furthermore, the total number of k-mer types for a specific amino acid sequence in the NAAKV method is less than that for a standard amino acid sequence. This conclusion is more applicable to large sequence-based datasets. The reason for this is largely because most possible k-mers do not appear in a specific amino acid sequence. For example, four codons (ACT, ACA, ACC, ACG) can encode threonine (T). According to the coding principle of NAAKV, the next codon after it may have 4*4=16 types. However, Figure 3The types of amino acids that may appear after the amino acid T shown in the figure. Many different codons may encode the same amino acid. Therefore, in a specific amino acid sequence, only 5 types of amino acids, L, P, H, Q and R, will appear after threonine, which is far less than 16.
[0078] exist Figure 3 In the expression, L, P, H, Q, R and T represent leucine, proline, histidine, glutamine, arginine and threonine respectively, codon represents codon, amino represents amino group H2N—, acid represents acid, L behind T represents TL, P behind T represents TP, H behind T represents TH, Q behind T represents TQ and R behind T represents TR.
[0079] In the actual processing process, the advantages of the NAAKV method provided by the present invention compared with the existing traditional non-alignment method based on classic k-mer and the alignment-based method include the following points:
[0080] (1) The NAAKV method obtained correct evolutionary results on five whole-genome datasets, including the novel coronavirus (SARS-CoV-2), dengue virus, HPV, HCV, and HBV datasets;
[0081] (2) The advantages of the NAAKV method compared with ordinary amino acid sequences: The parameter k value in the NAAKV method is very small, the calculation occupies less memory, and the accuracy is high. A perfect evolutionary tree is obtained for each gene data set; ordinary amino acid sequences do not have the above advantages;
[0082] (3) The advantages of the NAAKV method over the traditional muscle sequence alignment method (the traditional muscle sequence alignment method is a widely used evolutionary analysis tool with a high accuracy): the larger the gene sequence data set, the higher the memory occupied by the traditional muscle sequence alignment method, so the cost of using the muscle sequence alignment method is very high and time-consuming. The NAAKV method provided by the present invention is a convenient and fast evolutionary analysis algorithm;
[0083] (4) The total number of k-mer types in a specific amino acid sequence obtained using the NAAKV method provided by the present invention is far less than that in a common amino acid sequence. Therefore, the use of the NAAKV method can greatly improve efficiency, and the larger the gene sequence data set, the more obvious the advantage of improving efficiency.
[0084] In order to further verify the advantages of the NAAKV method, the bacterial data set can be used to compare the differences in the number of k-mer species of the specific amino acid sequence obtained using the NAAKV method and the traditional standard amino acid sequence, and the following can be obtained: Figure 4 The comparison results are shown in the graph. Figure 4 In the formula, PAAS refers to a particular amino acid sequence, standardaminoacidsequence refers to a standard amino acid sequence (SAAS), numberofk-mertypes refers to the number of k-mer types, and kvalue refers to the k value. Figure 4 As shown in Figure 2, by comparing the k-mer types of specific amino acid sequences in the bacterial dataset with those of traditional standard amino acid sequences, it can be seen that when the value of k is 3, the total number of k-mer types of traditional standard amino acid sequences may be 20. 3 = 8000. However, there are only 448 k-mers in the specific amino acid sequence obtained by the NAAKV method, which shows that the number of k-mer types in the specific amino acid sequence obtained by the NAAKV method is far less than that in the standard amino acid sequence, which can greatly reduce the computational time and improve the computational efficiency, so that the analysis efficiency and accuracy of genome evolution analysis can also be greatly improved.
[0085] The gene sequence non-alignment device provided by the present invention is described below. The gene sequence non-alignment device described below and the gene sequence non-alignment method described above can be referenced to each other.
[0086] Figure 5 An example of a non-alignment device for gene sequences is shown, such as Figure 5 As shown, the gene sequence non-alignment device 500 includes: a conversion module 510, which is used to convert a reference gene sequence into a target amino acid sequence based on a preset non-alignment principle; wherein the preset non-alignment principle is used to divide the reference gene sequence into target base groups and determine the target amino acid sequence based on the target base groups; a determination module 520, which is used to determine a target k-mer feature vector of the target amino acid sequence based on a preset k-mer model; wherein the preset k-mer model is used to determine the target k-mer feature vector based on the frequency of k consecutive target amino acids in the target amino acid sequence; a processing module 530, which is used to determine the distance matrix of the reference gene sequence according to the target k-mer feature vector to construct a developmental tree.
[0087] Optionally, the conversion module 510 can be specifically used to obtain a reference gene sequence, wherein the reference gene sequence includes n bases; based on a preset non-alignment principle, each consecutive m bases of the n bases are converted into a target base group, thereby obtaining a target amino acid sequence including multiple target base groups; wherein n and m are respectively integers greater than 1 and n>m.
[0088] Optionally, the conversion module 510 can also be specifically used to divide the n bases into n-2 target base groups based on a preset non-alignment principle; wherein each of the n-2 target base groups includes m consecutive bases and the n-2 first bases of the n-2 target base groups are consecutive, and n is an integer greater than 2; based on the n-2 target base groups, determine a target amino acid sequence including the n-2 target base groups; wherein the target amino acid sequence includes n-2 target amino acids and each of the target amino acids represents a target base group.
[0089] Optionally, the device may further include an acquisition module, specifically used to acquire a parameter k value; and determine a preset k-mer model corresponding to the parameter k value.
[0090] Optional, get module, can also be used based on value range Get the parameter k value; where [·] means · is a closed interval, represents rounding down, log represents logarithmic operation, min represents the length of the shortest gene sequence in the gene sequence database, p represents the number of amino acid types, and q represents a positive integer greater than 0.
[0091] Optionally, the processing module 530 may be specifically configured to calculate the Euclidean distances between different target k-mer feature vectors; and determine a distance matrix of multiple reference gene sequences based on the Euclidean distances.
[0092] Figure 6 An example of a physical structure diagram of an electronic device is shown in FIG. Figure 6 As shown, the electronic device 600 may include: a processor 610, a communications interface 620, a memory 630 and a communication bus 640, wherein the processor 610, the communications interface 620 and the memory 630 communicate with each other via the communication bus 640. The processor 610 may call the logic instructions in the memory 630 to execute the gene sequence non-alignment method, which includes:
[0093] Based on a preset non-alignment principle, converting the reference gene sequence into a target amino acid sequence; wherein the preset non-alignment principle is used to divide the reference gene sequence into target base groups and determine the target amino acid sequence based on the target base groups;
[0094] Determine a target k-mer feature vector of the target amino acid sequence based on a preset k-mer model; wherein the preset k-mer model is used to determine the target k-mer feature vector based on the frequency of k consecutive target amino acids in the target amino acid sequence;
[0095] According to the target k-mer feature vector, a distance matrix of the reference gene sequence is determined to construct a developmental tree.
[0096] In addition, the logic instructions in the above-mentioned memory 630 can be implemented in the form of a software functional unit and can be stored in a computer-readable storage medium when it is sold or used as an independent product. Based on such an understanding, the technical solution of the present invention can be essentially or partly embodied in the form of a software product that contributes to the prior art. The computer software product is stored in a storage medium, including several instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk, etc. Various media that can store program codes.
[0097] On the other hand, the present invention also provides a computer program product, the computer program product includes a computer program, the computer program can be stored on a non-transitory computer-readable storage medium, when the computer program is executed by a processor, the computer can perform the gene sequence non-alignment method provided by the above methods, the method comprising:
[0098] Based on a preset non-alignment principle, converting the reference gene sequence into a target amino acid sequence; wherein the preset non-alignment principle is used to divide the reference gene sequence into target base groups and determine the target amino acid sequence based on the target base groups;
[0099] Determine a target k-mer feature vector of the target amino acid sequence based on a preset k-mer model; wherein the preset k-mer model is used to determine the target k-mer feature vector based on the frequency of k consecutive target amino acids in the target amino acid sequence;
[0100] According to the target k-mer feature vector, a distance matrix of the reference gene sequence is determined to construct a developmental tree.
[0101] In another aspect, the present invention further provides a non-transitory computer-readable storage medium having a computer program stored thereon, which is implemented when the computer program is executed by a processor to perform the gene sequence non-alignment method provided by the above methods, the method comprising:
[0102] Based on a preset non-alignment principle, converting the reference gene sequence into a target amino acid sequence; wherein the preset non-alignment principle is used to divide the reference gene sequence into target base groups and determine the target amino acid sequence based on the target base groups;
[0103] Determine a target k-mer feature vector of the target amino acid sequence based on a preset k-mer model; wherein the preset k-mer model is used to determine the target k-mer feature vector based on the frequency of k consecutive target amino acids in the target amino acid sequence;
[0104] According to the target k-mer feature vector, a distance matrix of the reference gene sequence is determined to construct a developmental tree.
[0105] The device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. Ordinary technicians in this field can understand and implement it without paying creative labor.
[0106] Through the description of the above implementation methods, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus a necessary general hardware platform, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solution is essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.
[0107] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims
1. A non-alignment method for gene sequences, characterized in that: include: Based on a preset non-alignment principle, converting the reference gene sequence into a target amino acid sequence; wherein the preset non-alignment principle is used to divide the reference gene sequence into target base groups and determine the target amino acid sequence based on the target base groups; Determine a target k-mer feature vector of the target amino acid sequence based on a preset k-mer model; wherein the preset k-mer model is used to determine the target k-mer feature vector based on the frequency of k consecutive target amino acids in the target amino acid sequence; Determining a distance matrix of the reference gene sequence according to the target k-mer feature vector to construct a developmental tree; The method of converting the reference gene sequence into a target amino acid sequence based on a preset non-alignment principle includes: Obtaining a reference gene sequence, wherein the reference gene sequence includes n bases; Based on the preset non-alignment principle, each of the m consecutive bases in the n bases is converted into a target base group, thereby obtaining a target amino acid sequence including a plurality of the target base groups; wherein n and m are integers greater than 1 respectively and n>m.
2. The non-alignment method for gene sequences according to claim 1, characterized in that: Based on the preset non-alignment principle, each of the n bases, m consecutive bases, is converted into a target base group, thereby obtaining a target amino acid sequence including a plurality of the target base groups, including: Based on a preset non-alignment principle, the n bases are divided into n-2 target base groups; wherein each of the n-2 target base groups includes m consecutive bases and the n-2 first bases of the n-2 target base groups are consecutive, and n is an integer greater than 2; Based on the n-2 target base groups, a target amino acid sequence including the n-2 target base groups is determined; wherein the target amino acid sequence includes n-2 target amino acids and each of the target amino acids represents a target base group.
3. The non-alignment method for gene sequences according to claim 1, characterized in that: Before the step of determining the target k-mer feature vector of the target amino acid sequence based on the preset k-mer model, the method further includes: Get the parameter k value; Determine the preset k-mer model corresponding to the parameter k value.
4. The non-alignment method for gene sequences according to claim 3, characterized in that: The process of obtaining the parameter k value includes: Based on the value range , get the parameter k value; where, express is a closed interval, Express Round down, represents the logarithmic operation, Indicates the length of the shortest gene sequence in the gene sequence database, Indicates the number of amino acid types, Represents a positive integer greater than 0.
5. The non-alignment method for gene sequences according to claim 1, characterized in that: When there are multiple reference gene sequences, determining the distance matrix of the reference gene sequences according to the target k-mer feature vector to construct a developmental tree includes: Calculating the Euclidean distance between different target k-mer feature vectors; According to the Euclidean distance, a distance matrix of the plurality of reference gene sequences is determined.
6. A gene sequence non-comparison device, characterized in that: include: A conversion module, used to convert the reference gene sequence into a target amino acid sequence based on a preset non-alignment principle; wherein the preset non-alignment principle is used to divide the reference gene sequence into target base groups and determine the target amino acid sequence based on the target base groups; A determination module, based on a preset k-mer model, determines a target k-mer feature vector of the target amino acid sequence; wherein the preset k-mer model is used to determine the target k-mer feature vector based on the frequency of k consecutive target amino acids in the target amino acid sequence; A processing module, for determining a distance matrix of the reference gene sequence according to the target k-mer feature vector to construct a developmental tree; The conversion module is specifically used for: Obtaining a reference gene sequence, wherein the reference gene sequence includes n bases; Based on the preset non-alignment principle, each of the m consecutive bases in the n bases is converted into a target base group, thereby obtaining a target amino acid sequence including a plurality of the target base groups; wherein n and m are integers greater than 1 respectively and n>m.
7. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the steps of the gene sequence non-alignment method according to any one of claims 1 to 5 are implemented.
8. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the non-alignment method of gene sequence according to any one of claims 1 to 5 are implemented.
9. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the non-alignment method of gene sequence according to any one of claims 1 to 5 are implemented.
