CN107609342B - Protein conformation search method based on secondary structure space distance constraint - Google Patents
Protein conformation search method based on secondary structure space distance constraint Download PDFInfo
- Publication number
- CN107609342B CN107609342B CN201710683896.1A CN201710683896A CN107609342B CN 107609342 B CN107609342 B CN 107609342B CN 201710683896 A CN201710683896 A CN 201710683896A CN 107609342 B CN107609342 B CN 107609342B
- Authority
- CN
- China
- Prior art keywords
- individual
- individuals
- secondary structure
- distance
- space
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 102000004169 proteins and genes Human genes 0.000 title claims abstract description 36
- 108090000623 proteins and genes Proteins 0.000 title claims abstract description 36
- 238000000034 method Methods 0.000 title claims abstract description 34
- 230000002068 genetic effect Effects 0.000 claims abstract description 12
- 230000035772 mutation Effects 0.000 claims description 12
- 239000012634 fragment Substances 0.000 claims description 8
- 230000008569 process Effects 0.000 claims description 4
- 238000005070 sampling Methods 0.000 abstract description 4
- 238000004364 calculation method Methods 0.000 abstract 1
- 238000002474 experimental method Methods 0.000 description 5
- 238000005457 optimization Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 230000007547 defect Effects 0.000 description 2
- 238000005481 NMR spectroscopy Methods 0.000 description 1
- 150000001413 amino acids Chemical class 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 229960000074 biopharmaceutical Drugs 0.000 description 1
- 238000000205 computational method Methods 0.000 description 1
- 238000004883 computer application Methods 0.000 description 1
- 230000005494 condensation Effects 0.000 description 1
- 238000009833 condensation Methods 0.000 description 1
- 238000002884 conformational search Methods 0.000 description 1
- 230000018044 dehydration Effects 0.000 description 1
- 238000006297 dehydration reaction Methods 0.000 description 1
- 201000010099 disease Diseases 0.000 description 1
- 208000037265 diseases, disorders, signs and symptoms Diseases 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000001493 electron microscopy Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000036541 health Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 229920002521 macromolecule Polymers 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 125000002924 primary amino group Chemical group [H]N([H])* 0.000 description 1
- 238000000455 protein structure prediction Methods 0.000 description 1
- 238000002424 x-ray crystallography Methods 0.000 description 1
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
A protein conformation search method based on secondary structure space distance constraint is characterized in that under the basic framework of a genetic algorithm, a feature vector is formed by utilizing the space length of each secondary structure in a target protein and the space distance information between two adjacent secondary structure center residues to serve as a space limiting condition, so that under the condition of a given energy function, a solution space is searched in a smaller conformation space, and meanwhile, the space distance information is added into a selection operator, so that the inaccuracy of the energy function is compensated, and the accuracy of structure modeling is effectively improved. The invention provides a protein conformation search method based on secondary structure space distance constraint, which has the advantages of higher sampling efficiency, higher prediction precision and low calculation cost.
Description
Technical Field
The invention relates to the fields of biological informatics, artificial intelligence optimization and computer application, in particular to a protein conformation search method based on secondary structure space distance constraint.
Background
The protein is a biological macromolecule formed by amino acid dehydration condensation, plays a decisive role in human health, and has important significance in disease research, biopharmaceutical industry and the like by accurately mastering the structure and the function of the protein. The current methods for predicting protein structure mainly comprise two methods: experimental methods and theoretical predictions. The experimental methods include X-ray crystallography, nuclear magnetic resonance spectroscopy, electron microscopy, and the like; while these methods are capable of accurately determining the three-dimensional structure of certain proteins, determining the structure by experimental methods is time consuming and expensive, while the structure of some proteins is not at all accessible by experimental methods. Therefore, the use of computational methods to predict protein structure has been a focus in bioinformatics research. The theoretical prediction method mainly utilizes a computer technology and an intelligent optimization algorithm to predict the three-dimensional structure of the protein from the primary amino acid sequence, thereby effectively saving the prediction cost and reducing the prediction time, and compared with an experimental method, the method can be widely applied. However, the problem of predicting the three-dimensional structure of the protein is still a problem to be solved so far due to the complexity of the protein structure.
In the method for predicting the protein structure from the beginning, an evolutionary algorithm is an important method for researching protein molecule conformation optimization, such as genetic algorithm, differential evolution and other algorithms, and the algorithms have the advantages of high convergence rate, simple structure, strong robustness and the like. However, when the protein sequence is relatively long, because the conformational space is too large, if the search is performed according to a specific energy function, due to the inaccuracy of the energy function, it cannot be guaranteed that the conformation with the smallest energy is found closest to the native structure, and thus the correct folding is often not formed.
Therefore, the existing conformational space search methods have defects in prediction accuracy and sampling efficiency, and need to be improved.
Disclosure of Invention
In order to overcome the defects of low sampling efficiency and low prediction precision of the conventional protein structure prediction conformation space search method, the invention provides a protein conformation search method based on secondary structure space distance constraint, which has high sampling efficiency and high prediction precision.
The technical scheme adopted by the invention for solving the technical problems is as follows:
a method of protein conformation search based on secondary structure spatial distance constraints, the method comprising the steps of:
1) given input sequence information;
2) initializing parameters: is provided withPopulation size NP, maximum genetic algebra GmaxDetermining the cross probability PcInitial population iteration time iteration, cross segment length frag _ length, assembly counter reject _ number, maximum assembly time reject _ max, and feature vector D { D } formed by spatial length of secondary structure and spatial distance between two adjacent secondary structure center residues in prior knowledge1,…,dm,d1,2,…,dk,k+1In which d ismIs the length of the m-th secondary structural block of the target protein, dk,k+1Is the spatial distance between the kth secondary structure block and the kth +1 secondary structure central residue, the maximum distance constraint range, and the selection probability Ps;
3) Initializing a population: starting NP Monte Carlo tracks, searching each track for iteration times, and generating NP initial individuals;
4) for each target individual xiAnd randomly selected individuals xjThe following operations are performed, i, j ∈ (1.. NP), and j ≠ i:
4.1) by probability PcFor an individual xiAnd xjThe crossover operation was performed as follows:
4.1.1) randomly selecting a cross-over start point begin _ position within an allowable range [1, total _ residual-front _ length ], and simultaneously calculating a cross-over end _ position (begin _ position + front _ length), wherein total _ residual is the total number of residues;
4.1.2) at each intersection position ∈ [ begin _ position, end _ position ]]Carrying out torsion angle exchange to generate a new individual x'i,x′jI.e. cross individual x'i,x′j;
4.2) pairs of crossed individuals x'i,x′jThe following mutation operations were performed:
4.2.1) Cross individuals x 'by fragment Assembly technique'iPerforming spatial conformation search to calculate x 'of crossed individuals'iThe length of the secondary structure after the fragment assembly and the space distance between the central residues of two adjacent secondary structures form a distance vectorWhereinIs a crossed individual x'iThe length of the m-th secondary structure block,is the spatial distance of the kth secondary structure block center residue and the kth +1 secondary structure block center residue;
4.2.2) according to the formulaCalculate individual x'iFeature vector ofAnd the feature vector D ═ D in the prior knowledge1,…,dm,d1,2,…,dk,k+1The Manhattan distance of the individual x' generated by mutation if the similarity _ mutation _1 is less than or equal toiIf the secondary structure space distance constraint is met, turning to the step 4.2.4), otherwise, turning to the step 4.2.3);
4.2.3) the counter reject _ number starts counting, and if reject _ number is ≦ reject _ max, steps 4.2.1) and 4.2.2) are performed in sequence to generate the new individual x ″ "iStopping until the similarity _ rotation _1 is not more than the requirement; otherwise, step 4.2.1) is executed to generate a new individual x ″i;
4.2.4) Individual x 'in analogy to steps 4.2.1) and 4.2.2)'jAssembling the segments and calculating the corresponding Manhattan distance value similarity _ rotation _2 to obtain a new individual x ″)j;
4.2.5) according to the formulaCalculating a target individual xiDistance vector ofAnd the feature vector D ═ D in the prior knowledge1,…,dm,d1,2,…,dk,k+1The Manhattan distance of the };
5) according to the target individual xiAnd variant individuals x ″)i、x″jThe energy and distance similarity of the population is selected, the dominant individual is selected and the population is updated, the process is as follows:
5.1) function E (x) according to Rosetta Score3i) Calculating target individuals x respectivelyiAnd variant individuals x ″)i、x″jEnergy E (x) ofi)、E(x″i) And E (x ″)j);
5.2) in the target individual xiAnd variant individuals x ″)i、x″jIn (2), X ∈ { X } for a certain object Xi,x″i,x″jThe energy value of the individual is smaller than the energy values of the other two individuals, and the corresponding Manhattan distance value is smaller than the Manhattan distance values of the other two individuals, the individual is a dominant individual, and if an individual X ', X' ∈ { X is smaller than the Manhattan distance values of the other two individuals, the individual is a dominant individuali,x″i,x″jOnly if the energy value is smaller than the energy values of the other two individuals, according to the selection probability PsSetting the individual as a dominant individual, and similarly, if an individual is X ', X' ∈ { Xi,x″i,x″jOnly if the corresponding Manhattan distance value is smaller than the corresponding Manhattan distance values of the other two individuals, then the probability P is selectedsSetting the individual as a dominant individual; finally, replacing the target individual with the dominant individual, and updating the population;
6) judging whether the maximum genetic algebra G is reachedmaxAnd if the termination condition is met, outputting the result, otherwise, turning to the step 4).
The technical conception of the invention is as follows: under the basic framework of a genetic algorithm, a feature vector is formed by utilizing the space length of each secondary structure in a target protein and the space distance information between two adjacent secondary structure center residues as a space limiting condition, so that under the condition of a given energy function, a solution space is searched in a smaller conformation space, and meanwhile, the space distance information is added into a selection operator, the inaccuracy of the energy function is made up, and the accuracy of structure modeling is effectively improved.
The beneficial effects of the invention are as follows: on one hand, a feature vector is formed by the space length of the secondary structure and the space distance between two adjacent secondary structure center residues to serve as a space limiting condition, so that the conformational search space is reduced, errors caused by inaccurate energy functions are reduced, and the prediction precision is greatly improved; on the other hand, under the framework of a genetic algorithm, the convergence speed is accelerated and the diversity of the population is increased through information interaction among individuals and variation selection operation of parent individuals.
Drawings
FIG. 1 is a basic flow diagram of a protein conformation search method based on secondary structure spatial distance constraints.
FIG. 2 is a schematic diagram of conformation update in the structural prediction of protein 1AIL by a protein conformation search method based on secondary structure space distance constraint.
FIG. 3 is a three-dimensional structure diagram of protein 1AIL predicted by a protein conformation search method based on secondary structure space distance constraints.
Detailed Description
The invention is further described below with reference to the accompanying drawings.
Referring to fig. 1 to 3, a method for protein conformation search based on secondary structure spatial distance constraint, the method comprising the steps of:
1) given input sequence information;
2) initializing parameters: setting population size NP and maximum genetic algebra GmaxDetermining the cross probability PcInitial population iteration time iteration, cross segment length frag _ length, assembly counter reject _ number, maximum assembly time reject _ max, and feature vector D { D } formed by spatial length of secondary structure and spatial distance between two adjacent secondary structure center residues in prior knowledge1,…,dm,d1,2,…,dk,k+1In which d ismIs the length of the m-th secondary structural block of the target protein, dk,k+1Is the spatial distance of the kth secondary structure block and the kth +1 secondary structure center residue, the maximum distance constraintRange, selection probability Ps;
3) Initializing a population: starting NP Monte Carlo tracks, searching each track for iteration times, and generating NP initial individuals;
4) for each target individual xiAnd randomly selected individuals xjThe following operations are performed, i, j ∈ (1.. NP), and j ≠ i:
4.1) by probability PcFor an individual xiAnd xjThe crossover operation was performed as follows:
4.1.1) randomly selecting a cross-over start point begin _ position within an allowable range [1, total _ residual-front _ length ], and simultaneously calculating a cross-over end _ position (begin _ position + front _ length), wherein total _ residual is the total number of residues;
4.1.2) at each intersection position ∈ [ begin _ position, end _ position ]]Carrying out torsion angle exchange to generate a new individual x'i,x′jI.e. cross individual x'i,x′j;
4.2) pairs of crossed individuals x'i,x′jThe following mutation operations were performed:
4.2.1) Cross individuals x 'by fragment Assembly technique'iPerforming spatial conformation search to calculate x 'of crossed individuals'iThe length of the secondary structure after the fragment assembly and the space distance between the central residues of two adjacent secondary structures form a distance vectorWhereinIs a crossed individual x'iThe length of the m-th secondary structure block,is the spatial distance of the kth secondary structure block center residue and the kth +1 secondary structure block center residue;
4.2.2) according to the formulaCalculate individual x'iFeature vector ofAnd the feature vector D ═ D in the prior knowledge1,…,dm,d1,2,…,dk,k+1The Manhattan distance of the individual x' generated by mutation if the similarity _ mutation _1 is less than or equal toiIf the secondary structure space distance constraint is met, turning to the step 4.2.4), otherwise, turning to the step 4.2.3);
4.2.3) the counter reject _ number starts counting, and if reject _ number is ≦ reject _ max, steps 4.2.1) and 4.2.2) are performed in sequence to generate the new individual x ″ "iStopping until the similarity _ rotation _1 is not more than the requirement; otherwise, step 4.2.1) is executed to generate a new individual x ″i;
4.2.4) Individual x 'in analogy to steps 4.2.1) and 4.2.2)'jAssembling the segments and calculating the corresponding Manhattan distance value similarity _ rotation _2 to obtain a new individual x ″)j;
4.2.5) according to the formulaCalculating a target individual xiDistance vector ofAnd the feature vector D ═ D in the prior knowledge1,…,dm,d1,2,…,dk,k+1The Manhattan distance of the };
5) according to the target individual xiAnd variant individuals x ″)i、x″jThe energy and distance similarity of the population is selected, the dominant individual is selected and the population is updated, the process is as follows:
5.1) function E (x) according to Rosetta Score3i) Calculating target individuals x respectivelyiAnd variant individuals x ″)i、x″jEnergy E (x) ofi)、E(x″i) And E (x ″)j);
5.2) in the target individual xiAnd changeHetero entity x ″)i、x″jIn (2), X ∈ { X } for a certain object Xi,x″i,x″jThe energy value of the individual is smaller than the energy values of the other two individuals, and the corresponding Manhattan distance value is smaller than the Manhattan distance values of the other two individuals, the individual is a dominant individual, and if an individual X ', X' ∈ { X is smaller than the Manhattan distance values of the other two individuals, the individual is a dominant individuali,x″i,x″jOnly if the energy value is smaller than the energy values of the other two individuals, according to the selection probability PsSetting the individual as a dominant individual, and similarly, if an individual is X ', X' ∈ { Xi,x″i,x″jOnly if the corresponding Manhattan distance value is smaller than the corresponding Manhattan distance values of the other two individuals, then the probability P is selectedsSetting the individual as a dominant individual; finally, replacing the target individual with the dominant individual, and updating the population;
6) judging whether the maximum genetic algebra G is reachedmaxAnd if the termination condition is met, outputting the result, otherwise, turning to the step 4).
In this embodiment, the α -sheet protein 1AIL with a sequence length of 73 is an embodiment, and a protein conformation search method based on secondary structure space distance constraint, comprising the following steps:
1) given input sequence information;
2) initializing parameters: setting the population size NP to 200, and setting the maximum genetic algebra GmaxDetermining a crossover probability P of 2000c0.1, 2000 initial population iteration times, 9 cross segment length, 0 assembly counter reject _ number, 100 maximum assembly times reject _ max, 15 maximum distance constraint range, 15 probability P, wherein the feature vector D composed of spatial length of secondary structure and spatial distance between two adjacent secondary structure center residues in prior knowledge is {3.81085,33.8066,8.38603,30.3193,6.69076,22.1852,19.6409,17.2739,15.4455,14.6372,15.5907,12.43}, and the maximum distance constraint ranges=0.3;
3) Initializing a population: starting NP Monte Carlo tracks, searching each track for iteration times, and generating NP initial individuals;
4) for each target individual xiAnd randomly selectTaken individual xjThe following operations are performed, i, j ∈ (1.. NP), and j ≠ i:
4.1) by probability PcFor an individual xiAnd xjThe crossover operation was performed as follows:
4.1.1) randomly selecting a cross-over start point begin _ position within an allowable range [1, total _ residual-front _ length ], and simultaneously calculating a cross-over end _ position (begin _ position + front _ length), wherein total _ residual is the total number of residues;
4.1.2) at each intersection position ∈ [ begin _ position, end _ position ]]Carrying out torsion angle exchange to generate a new individual x'i,x′jI.e. cross individual x'i,x′j;
4.2) pairs of crossed individuals x'i,x′jThe following mutation operations were performed:
4.2.1) Cross individuals x 'by fragment Assembly technique'iPerforming spatial conformation search to calculate x 'of crossed individuals'iThe length of the secondary structure after the fragment assembly and the space distance between the central residues of two adjacent secondary structures form a distance vectorWhereinIs a crossed individual x'iThe length of the m-th secondary structure block,is the spatial distance of the kth secondary structure block center residue and the kth +1 secondary structure block center residue;
4.2.2) according to the formulaCalculate individual x'iFeature vector ofAnd features in a priori knowledgeSign vector D ═ D1,…,dm,d1,2,…,dk,k+1The Manhattan distance of the individual x' generated by mutation if the similarity _ mutation _1 is less than or equal toiIf the secondary structure space distance constraint is met, turning to the step 4.2.4), otherwise, turning to the step 4.2.3);
4.2.3) the counter reject _ number starts counting, and if reject _ number is ≦ reject _ max, steps 4.2.1) and 4.2.2) are performed in sequence to generate the new individual x ″ "iStopping until the similarity _ rotation _1 is not more than the requirement; otherwise, step 4.2.1) is executed to generate a new individual x ″i;
4.2.4) Individual x 'in analogy to steps 4.2.1) and 4.2.2)'jAssembling the segments and calculating the corresponding Manhattan distance value similarity _ rotation _2 to obtain a new individual x ″)j;
4.2.5) according to the formulaCalculating a target individual xiDistance vector ofAnd the feature vector D ═ D in the prior knowledge1,…,dm,d1,2,…,dk,k+1The Manhattan distance of the };
5) according to the target individual xiAnd variant individuals x ″)i、x″jThe energy and distance similarity of the population is selected, the dominant individual is selected and the population is updated, the process is as follows:
5.1) function E (x) according to Rosetta Score3i) Calculating target individuals x respectivelyiAnd variant individuals x ″)i、x″jEnergy E (x) ofi)、E(x″i) And E (x ″)j);
5.2) in the target individual xiAnd variant individuals x ″)i、x″jIn (2), X ∈ { X } for a certain object Xi,x″i,x″jThe energy value of the person is less than the energy values of the other two persons, and the corresponding Manhattan distance value is less than the Manhattan distance values of the other two persons, so that the person isDominant individual, if an individual X ', X' ∈ { X }i,x″i,x″jOnly if the energy value is smaller than the energy values of the other two individuals, according to the selection probability PsSetting the individual as a dominant individual, and similarly, if an individual is X ', X' ∈ { Xi,x″i,x″jOnly if the corresponding Manhattan distance value is smaller than the corresponding Manhattan distance values of the other two individuals, then the probability P is selectedsSetting the individual as a dominant individual; finally, replacing the target individual with the dominant individual, and updating the population;
6) judging whether the maximum genetic algebra G is reachedmaxAnd if the termination condition is met, outputting the result, otherwise, turning to the step 4).
Using the α -folded protein 1AIL with a sequence length of 73 as an example, the above method was used to obtain the near-native conformation of the protein with a minimum RMS deviation ofMean root mean square deviation ofThe prediction structure is shown in fig. 3.
The above description is the optimization effect of the present invention using 1AIL protein as an example, and is not intended to limit the scope of the present invention, and various modifications and improvements can be made without departing from the scope of the present invention.
Claims (1)
1. A protein conformation search method based on secondary structure space distance constraint is characterized in that: the conformational space search method comprises the following steps:
1) given input sequence information;
2) initializing parameters: setting population size NP and maximum genetic algebra GmaxDetermining the cross probability PcInitial population iteration time iteration, cross segment length frag _ length, assembly counter reject _ number, maximum assembly time reject _ max, second level in priori knowledgeThe space length of the structure and the space distance between two adjacent secondary structure center residues form a feature vector D ═ { D ═ D1,…,dm,d1,2,…,dk,k+1In which d ismIs the length of the m-th secondary structural block of the target protein, dk,k+1Is the spatial distance between the kth secondary structure block and the kth +1 secondary structure central residue, the maximum distance constraint range, and the selection probability Ps;
3) Initializing a population: starting NP Monte Carlo tracks, searching each track for iteration times, and generating NP initial individuals;
4) for each target individual xiAnd randomly selected individuals xjThe following operations are performed, i, j ∈ (1.. NP), and j ≠ i:
4.1) by probability PcFor an individual xiAnd xjThe crossover operation was performed as follows:
4.1.1) randomly selecting a cross-over start point begin _ position within an allowable range [1, total _ residual-front _ length ], and simultaneously calculating a cross-over end _ position (begin _ position + front _ length), wherein total _ residual is the total number of residues;
4.1.2) at each intersection position ∈ [ begin _ position, end _ position ]]Carrying out torsion angle exchange to generate a new individual x'i,x′jI.e. cross individual x'i,x′j;
4.2) pairs of crossed individuals x'i,x′jThe following mutation operations were performed:
4.2.1) Cross individuals x 'by fragment Assembly technique'iPerforming spatial conformation search to calculate x 'of crossed individuals'iThe length of the secondary structure after the fragment assembly and the space distance between the central residues of two adjacent secondary structures form a distance vectorWhereinIs a crossed individual x'iThe length of the m-th secondary structure block,is a crossed individual x'iThe spatial distance between the kth secondary structure block center residue and the (k + 1) th secondary structure block center residue;
4.2.2) according to the formulaCalculate individual x'iFeature vector ofAnd the feature vector D ═ D in the prior knowledge1,…,dm,d1,2,…,dk,k+1The Manhattan distance of the individual x' generated by mutation if the similarity _ mutation _1 is less than or equal toiIf the secondary structure space distance constraint is met, turning to the step 4.2.4), otherwise, turning to the step 4.2.3);
4.2.3) the counter reject _ number starts counting, and if reject _ number is ≦ reject _ max, steps 4.2.1) and 4.2.2) are performed in sequence to generate the new individual x ″ "iStopping until the similarity _ rotation _1 is not more than the requirement; otherwise, step 4.2.1) is executed to generate a new individual x ″i;
4.2.4) Individual x 'in analogy to steps 4.2.1) and 4.2.2)'jAssembling the segments and calculating the corresponding Manhattan distance value similarity _ rotation _2 to obtain a new individual x ″)j;
4.2.5) according to the formulaCalculating a target individual xiDistance vector ofAnd the feature vector D ═ D in the prior knowledge1,…,dm,d1,2,…,dk,k+1The Manhattan distance of the };
5) according to the target individual xiAnd variant individuals x ″)i、x″jThe energy and distance similarity of the population is selected, the dominant individual is selected and the population is updated, the process is as follows:
5.1) function E (x) according to Rosetta Score3i) Calculating target individuals x respectivelyiAnd variant individuals x ″)i、x″jEnergy E (x) ofi)、E(x″i) And E (x ″)j);
5.2) in the target individual xiAnd variant individuals x ″)i、x″jIn (2), X ∈ { X } for a certain object Xi,x″i,x″jThe energy value of the individual is smaller than the energy values of the other two individuals, and the corresponding Manhattan distance value is smaller than the Manhattan distance values of the other two individuals, the individual is a dominant individual, and if an individual X ', X' ∈ { X is smaller than the Manhattan distance values of the other two individuals, the individual is a dominant individuali,x″i,x″jOnly if the energy value is smaller than the energy values of the other two individuals, according to the selection probability PsSetting the individual as a dominant individual, and similarly, if an individual is X ', X' ∈ { Xi,x″i,x″jOnly if the corresponding Manhattan distance value is smaller than the corresponding Manhattan distance values of the other two individuals, then the probability P is selectedsSetting the individual as a dominant individual; finally, replacing the target individual with the dominant individual, and updating the population;
6) judging whether the maximum genetic algebra G is reachedmaxAnd if the termination condition is met, outputting the result, otherwise, turning to the step 4).
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710683896.1A CN107609342B (en) | 2017-08-11 | 2017-08-11 | Protein conformation search method based on secondary structure space distance constraint |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710683896.1A CN107609342B (en) | 2017-08-11 | 2017-08-11 | Protein conformation search method based on secondary structure space distance constraint |
Publications (2)
Publication Number | Publication Date |
---|---|
CN107609342A CN107609342A (en) | 2018-01-19 |
CN107609342B true CN107609342B (en) | 2020-08-18 |
Family
ID=61065372
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201710683896.1A Active CN107609342B (en) | 2017-08-11 | 2017-08-11 | Protein conformation search method based on secondary structure space distance constraint |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN107609342B (en) |
Families Citing this family (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108647486B (en) * | 2018-03-22 | 2021-06-18 | 浙江工业大学 | Protein three-dimensional structure prediction method based on conformation diversity strategy |
CN109033753B (en) * | 2018-06-07 | 2021-06-18 | 浙江工业大学 | Group protein structure prediction method based on secondary structure fragment assembly |
CN109101785B (en) * | 2018-07-12 | 2021-06-18 | 浙江工业大学 | Protein structure prediction method based on secondary structure similarity selection strategy |
CN109243526B (en) * | 2018-07-12 | 2021-08-03 | 浙江工业大学 | Protein structure prediction method based on specific fragment crossing |
CN109002691B (en) * | 2018-07-12 | 2021-11-23 | 浙江工业大学 | Protein structure prediction method based on Boltzmann update strategy |
CN109326319B (en) * | 2018-08-28 | 2021-05-18 | 浙江工业大学 | Protein conformation space optimization method based on secondary structure knowledge |
CN109360600B (en) * | 2018-08-28 | 2021-05-18 | 浙江工业大学 | Protein structure prediction method based on residue characteristic distance |
CN109360598B (en) * | 2018-08-28 | 2021-06-18 | 浙江工业大学 | Protein structure prediction method based on two-stage sampling |
CN109378034B (en) * | 2018-08-28 | 2021-06-18 | 浙江工业大学 | Protein prediction method based on distance distribution estimation |
CN109300505B (en) * | 2018-08-29 | 2021-05-18 | 浙江工业大学 | Protein structure prediction method based on biased sampling |
CN109300506B (en) * | 2018-08-29 | 2021-05-18 | 浙江工业大学 | Protein structure prediction method based on specific distance constraint |
CN109326320B (en) * | 2018-08-29 | 2021-06-18 | 浙江工业大学 | Adaptive protein structure prediction method for ensemble conformation selection strategy |
CN109390035B (en) * | 2018-08-29 | 2021-04-06 | 浙江工业大学 | Protein conformation space optimization method based on local structure comparison |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104063632A (en) * | 2014-06-27 | 2014-09-24 | 南京理工大学 | Prediction method for protein sequence disulfide bond connection mode based on forest regression model |
CN105205348A (en) * | 2015-09-22 | 2015-12-30 | 浙江工业大学 | Method for colony conformation space optimization based on distance constraint selection strategy |
-
2017
- 2017-08-11 CN CN201710683896.1A patent/CN107609342B/en active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104063632A (en) * | 2014-06-27 | 2014-09-24 | 南京理工大学 | Prediction method for protein sequence disulfide bond connection mode based on forest regression model |
CN105205348A (en) * | 2015-09-22 | 2015-12-30 | 浙江工业大学 | Method for colony conformation space optimization based on distance constraint selection strategy |
Non-Patent Citations (3)
Title |
---|
Computational Prediction of Protein Secondary Structure from Sequence;Fanchi Meng等;《Current Protocols in Protein Science》;20161231;1-10 * |
基于距离约束的蛋白质空间结构预测;王彩霞;《中国优秀硕士学位论文全文数据库 基础科学辑》;20160215;16-41 * |
基于量子多种群遗传算法的蛋白质二级结构预测;田远等;《中国农学通报》;20131231;第29卷(第30期);166-172 * |
Also Published As
Publication number | Publication date |
---|---|
CN107609342A (en) | 2018-01-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN107609342B (en) | Protein conformation search method based on secondary structure space distance constraint | |
Deng et al. | Protein structure prediction | |
Zheng et al. | Detecting distant-homology protein structures by aligning deep neural-network based contact maps | |
CN112585686A (en) | Machine learning to determine protein structure | |
CN107633159B (en) | Protein conformation space search method based on distance similarity | |
CN107633157B (en) | Protein conformation space optimization method based on distribution estimation and copy exchange strategy | |
CN106650305B (en) | A kind of more tactful group Advances in protein structure prediction based on local abstract convex supporting surface | |
Zhang et al. | Enhancing protein conformational space sampling using distance profile-guided differential evolution | |
CN109448784B (en) | Protein structure prediction method based on dihedral angle information auxiliary energy function selection | |
CN107491664B (en) | Protein structure de novo prediction method based on information entropy | |
CN109360599B (en) | Protein structure prediction method based on residue contact information cross strategy | |
CN109086566B (en) | Group protein structure prediction method based on fragment resampling | |
CN109215733B (en) | Protein structure prediction method based on residue contact information auxiliary evaluation | |
Li et al. | Deep learning geometrical potential for high-accuracy ab initio protein structure prediction | |
Saraswathi et al. | Fast learning optimized prediction methodology (FLOPRED) for protein secondary structure prediction | |
Zhang et al. | Two-stage distance feature-based optimization algorithm for de novo protein structure prediction | |
CN109378034B (en) | Protein prediction method based on distance distribution estimation | |
CN108920894B (en) | Protein conformation space optimization method based on brief abstract convex estimation | |
CN109390035B (en) | Protein conformation space optimization method based on local structure comparison | |
CN109300505B (en) | Protein structure prediction method based on biased sampling | |
Bernard et al. | State-of-the-RNArt: benchmarking current methods for RNA 3D structure prediction | |
CN109448785B (en) | Protein structure prediction method for enhancing Loop region structure by using Laplace graph | |
CN109360600B (en) | Protein structure prediction method based on residue characteristic distance | |
CN109411013B (en) | Group protein structure prediction method based on individual specific variation strategy | |
CN109326319B (en) | Protein conformation space optimization method based on secondary structure knowledge |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |