CN109411013B - Group protein structure prediction method based on individual specific variation strategy - Google Patents

Group protein structure prediction method based on individual specific variation strategy Download PDF

Info

Publication number
CN109411013B
CN109411013B CN201810993742.7A CN201810993742A CN109411013B CN 109411013 B CN109411013 B CN 109411013B CN 201810993742 A CN201810993742 A CN 201810993742A CN 109411013 B CN109411013 B CN 109411013B
Authority
CN
China
Prior art keywords
conformation
fragment
population
trial
conformations
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
Application number
CN201810993742.7A
Other languages
Chinese (zh)
Other versions
CN109411013A (en
Inventor
周晓根
张贵军
刘俊
彭春祥
胡俊
郝小虎
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhejiang University of Technology ZJUT
Original Assignee
Zhejiang University of Technology ZJUT
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Zhejiang University of Technology ZJUT filed Critical Zhejiang University of Technology ZJUT
Priority to CN201810993742.7A priority Critical patent/CN109411013B/en
Publication of CN109411013A publication Critical patent/CN109411013A/en
Application granted granted Critical
Publication of CN109411013B publication Critical patent/CN109411013B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Investigating Or Analysing Biological Materials (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

Under the framework of a differential evolution algorithm, aiming at each conformation, calculating the distance between the conformation and all other conformations in the current population, and calculating a search state factor of the conformation according to the average distance, the maximum distance and the minimum distance to determine the state of the conformation individual; if the probability that the conformation is in a local search state is high, selecting partial individuals adjacent to the conformation, and selecting the optimal individual from the individuals to guide the variation process of the conformation; randomly selecting conformations from the whole population to mutate if the conformations are in a global probing state; therefore, a specific variation strategy is set for each conformation, and the effects of improving sampling efficiency and maintaining population diversity are achieved. The invention provides a group protein structure prediction method based on an individual specific variation strategy, which has high search efficiency and prediction precision.

Description

Group protein structure prediction method based on individual specific variation strategy
Technical Field
The invention relates to the fields of bioinformatics, intelligent optimization and computer application, in particular to a group protein structure prediction method based on an individual specific variation strategy.
Background
In 1990, the human genome project was initiated in the United states and formally announced to completion in 2003. Over a decade, the human genome project has increasingly deepened human awareness of self and disease, and has profound effects on medicine, mathematics, biology and computer science. However, to date, the blueprint depicted by president clinton, usa, has not been presented: "radically changes our means of diagnosis, prevention and treatment of most diseases". The reason for this is that genetic maps only map the amino acid sequence of a protein (i.e., the primary structure of a protein), and a protein can produce its specific biological function only by folding into a specific three-dimensional structure (i.e., the tertiary structure). The correspondence between the primary structure of a protein sequence and its tertiary structure (i.e., the second genetic code, or folding code) is still an unblended mystery relative to the first genetic code, i.e., the amino acid sequence of a protein that is translated from a set of three nucleotides into DNA. Compared with protein folding, protein structure prediction has stronger practicability, and gene diagnosis can be really realized only by obtaining the three-dimensional structure of the protein, and finally the purpose of gene therapy is achieved.
At present, experimental methods for determining the three-dimensional structure of proteins include X-ray crystallography, multidimensional Nuclear Magnetic Resonance (NMR), cryoelectron microscopy, and the like. X-ray crystal diffraction is the most effective method for determining the protein structure at present, the achieved precision is incomparable with other methods, and the main defects are that the protein crystal is difficult to culture and the period for determining the crystal structure is long; the NMR method can directly determine the conformation of the protein in the solution, but the required amount of the sample is large, the purity requirement is high, and only small molecular protein can be determined at present. Second, these experimental assays are expensive, requiring hundreds of thousands of dollars to determine the three-dimensional structure of a protein, however, only about $ 1000 to determine the primary amino acid sequence of a protein, resulting in an increasing gap between protein sequence and three-dimensional structure determination. Therefore, it is an important research topic in bioinformatics to directly predict the three-dimensional structure of a protein from an amino acid sequence by using a computer as a tool and using an appropriate algorithm.
Conformational space optimization (or sampling) is one of the most critical factors that currently restrict the accuracy of de novo protein structure prediction. The Differential Evolution (DE) is the most powerful algorithm in the Evolution algorithm, and is a stochastic algorithm proposed by Price and storm in 1995. The DE algorithm has the advantages of simple structure, high convergence rate, strong robustness and the like, and is widely applied to the field of protein conformation space optimization. Sudha et al propose a differential evolution protein structure prediction method based on a local strategy; custodio et al propose a local group protein structure prediction method based on a similarity agent model; based on a DE algorithm, a Shehu research group provides a series of effective protein conformation space optimization methods, such as a multi-scale hybrid evolution algorithm HEA and a multi-objective conformation space optimization method MOEA. However, in the DE algorithm, different variation strategies have different advantages, for example, some strategies have stronger global detection capability, and some strategies have stronger local search capability. In addition, during evolution, better and poorer conformational individuals play different roles. The better individuals are responsible for directing the search direction of the algorithm, while the worse individuals are responsible for maintaining the diversity of the population. Because only one conformational mutation strategy is used in the whole evolution process, the search efficiency of the algorithm is reduced, and the algorithm is easy to fall into local optimization, so that the final prediction precision is influenced.
Therefore, the existing population protein structure prediction methods have defects in prediction accuracy and search efficiency, and improvement is required.
Disclosure of Invention
In order to overcome the defects of low prediction precision and search efficiency of the conventional group protein structure prediction method, the invention provides the group protein structure prediction method based on the individual specific variation strategy, which has high prediction precision and search efficiency.
The technical scheme adopted by the invention for solving the technical problems is as follows:
a method for population protein structure prediction based on individual specific variation strategies, the method comprising the steps of:
1) inputting sequence information of a protein to be detected, and obtaining a fragment library from a ROBETTA server (http:// www.robetta.org /);
2) setting parameters: setting population size NP, cross probability CR, segment length l, temperature factor KT, adjacent individual number N and maximum iteration number GmaxInitializing the iteration number g to be 0;
3)randomly selecting fragments from a fragment library corresponding to each residue position to assemble to generate an initial conformation population P ═ C1,C2,...,CNPIn which C isiI ═ {1,2, …, NP } is the ith conformational individual in population P;
4) calculating the energy value of each conformation in the current population according to the energy function of Rosetta socre 3;
5) for each conformation C in the populationiI ∈ {1,2, …, NP } performs the following:
5.1) reduction of conformation CiConsidering the target conformation, calculating Euclidean distances between the target conformation and other NP-1 conformations according to carbon alpha atoms, and marking the distance between the target conformation and the jth conformation as dj
5.2) calculation of NP-1 distances djJ-1, 2, NP-1 average daveAnd the largest distance among the NP-1 distances is recorded as dmaxAnd the minimum distance is denoted as dmin
5.3) calculating the search State factor for the target conformation
Figure BDA0001781396740000031
5.4) randomly generating a fraction between 0 and 1
Figure BDA0001781396740000032
If it is not
Figure BDA0001781396740000033
The following operations are performed:
5.4.1) selecting the N conformations closest to the target conformation and selecting the conformation C with the lowest energy among the N conformationspbestAnd randomly selecting two adjacent constellations from the N adjacent constellations which are different from each other and are CpbestDifferent conformation CaAnd Cb
5.4.2) randomly generating a random integer R 'between 1 and 2, if R' is 1, from the constellation C, respectivelyaAnd CbWherein a fragment of length l different from the residue is randomly selected for substitution conformation CpbestFragment of the corresponding position in (1), generating the mutationConformation Cmutant
5.4.3) if R' is 2, respectively from conformation CpbestAnd CbWherein a fragment of length l different from the residue is randomly selected for substitution conformation CaFragment of the corresponding position in (1), generating a mutated conformation Cmutant
5.5) if
Figure BDA0001781396740000034
The following operations are performed:
5.5.1) randomly selecting three conformations C from the current population, which are different from each other and from the target conformationc、CdAnd Ce
5.5.2) from C, respectivelyc、CdAnd CeWherein a fragment of length l different in residue position is randomly selected to replace target conformation CiFragment of the corresponding position in (1), generating a mutated conformation Cmutant
5.6) randomly generating a decimal R between 0 and 1, if R<CR, from conformation CiWherein a fragment of length l is randomly selected to replace the mutated conformation CmutantAnd performing random fragment assembly once to generate test conformation Ctrial(ii) a Otherwise, the variant conformation is directly subjected to one-time random fragment assembly to generate a test conformation Ctrial
5.7) calculation of the test conformation C according to the Rosetta score3 energy functiontrialThe energy value of (a);
5.8) if CtrialEnergy value of less than CiEnergy value of (1), then CtrialReplacement CiOtherwise according to Boltzmann probability
Figure BDA0001781396740000035
With CtrialReplacement CiWherein Δ E is CtrialEnergy value of and CiAbsolute value of the energy value error of (a);
6) g is g +1, if g>GmaxThe conformation with the lowest energy is output as the final predicted structure, otherwise, the step 5) is returned to.
The technical conception of the invention is as follows: under the framework of a differential evolution algorithm, for each conformation, calculating the distance between the conformation and all other conformations in the current population, and calculating a search state factor of the conformation according to the average distance, the maximum distance and the minimum distance to determine the state of the conformation individual; if the probability that the conformation is in a local search state is high, selecting partial individuals adjacent to the conformation, and selecting the optimal individual from the individuals to guide the variation process of the conformation; randomly selecting conformations from the whole population to mutate if the conformations are in a global probing state; therefore, a specific variation strategy is set for each conformation, and the effects of improving sampling efficiency and maintaining population diversity are achieved. The invention provides a group protein structure prediction method based on an individual specific variation strategy, which has high search efficiency and prediction precision.
The beneficial effects of the invention are as follows: the search state of each conformation is measured according to the distance between the conformation and other conformations, and different variation strategies are designed according to the conformations in different states to guide conformation search, so that the effect of improving and maintaining population diversity is achieved, and the prediction precision is improved.
Drawings
Fig. 1 is a schematic diagram of the conformational update when protein 1BQ9 is structurally predicted by a population protein structure prediction method based on an individual specific variation strategy.
FIG. 2 is a conformational distribution diagram obtained when protein 1BQ9 is structurally predicted by a population protein structure prediction method based on an individual specific variation strategy.
FIG. 3 is a three-dimensional structure diagram obtained by predicting the structure of protein 1BQ9 by a population protein structure prediction method based on an individual-specific mutation strategy.
Detailed Description
The invention is further described below with reference to the accompanying drawings.
Referring to fig. 1 to 3, a method for predicting a group protein structure based on an individual specific variation strategy includes the following steps:
1) inputting sequence information of a protein to be detected, and obtaining a fragment library from a ROBETTA server (http:// www.robetta.org /);
2) setting parameters: setting population size NP, cross probability CR, segment length l, temperature factor KT, adjacent individual number N and maximum iteration number GmaxInitializing the iteration number g to be 0;
3) randomly selecting fragments from a fragment library corresponding to each residue position to assemble to generate an initial conformation population P ═ C1,C2,...,CNPIn which C isiI ═ {1,2, …, NP } is the ith conformational individual in population P;
4) calculating the energy value of each conformation in the current population according to the energy function of Rosetta socre 3;
5) for each conformation C in the populationiI ∈ {1,2, …, NP } performs the following:
5.1) reduction of conformation CiConsidering the target conformation, calculating Euclidean distances between the target conformation and other NP-1 conformations according to carbon alpha atoms, and marking the distance between the target conformation and the jth conformation as dj
5.2) calculation of NP-1 distances djJ-1, 2, NP-1 average daveAnd the largest distance among the NP-1 distances is recorded as dmaxAnd the minimum distance is denoted as dmin
5.3) calculating the search State factor for the target conformation
Figure BDA0001781396740000051
5.4) randomly generating a fraction between 0 and 1
Figure BDA0001781396740000052
If it is not
Figure BDA0001781396740000053
The following operations are performed:
5.4.1) selecting the N conformations closest to the target conformation and selecting the conformation C with the lowest energy among the N conformationspbestAnd randomly selecting two adjacent constellations from the N adjacent constellations which are different from each other and are CpbestDifferent conformation CaAnd Cb
5.4.2) randomly generating a random integer R 'between 1 and 2, if R' is 1, from the constellation C, respectivelyaAnd CbWherein a fragment of length l different from the residue is randomly selected for substitution conformation CpbestFragment of the corresponding position in (1), generating a mutated conformation Cmutant
5.4.3) if R' is 2, respectively from conformation CpbestAnd CbWherein a fragment of length l different from the residue is randomly selected for substitution conformation CaFragment of the corresponding position in (1), generating a mutated conformation Cmutant
5.5) if
Figure BDA0001781396740000054
The following operations are performed:
5.5.1) randomly selecting three conformations C from the current population, which are different from each other and from the target conformationc、CdAnd Ce
5.5.2) from C, respectivelyc、CdAnd CeWherein a fragment of length l different in residue position is randomly selected to replace target conformation CiFragment of the corresponding position in (1), generating a mutated conformation Cmutant
5.6) randomly generating a decimal R between 0 and 1, if R<CR, from conformation CiWherein a fragment of length l is randomly selected to replace the mutated conformation CmutantAnd performing random fragment assembly once to generate test conformation Ctrial(ii) a Otherwise, the variant conformation is directly subjected to one-time random fragment assembly to generate a test conformation Ctrial
5.7) calculation of the test conformation C according to the Rosetta score3 energy functiontrialThe energy value of (a);
5.8) if CtrialEnergy value of less than CiEnergy value of (1), then CtrialReplacement CiOtherwise according to Boltzmann probability
Figure BDA0001781396740000061
With CtrialReplacement CiWherein Δ E is CtrialEnergy value of and CiAbsolute value of the energy value error of (a);
6) g is g +1, if g>GmaxThe conformation with the lowest energy is output as the final predicted structure, otherwise, the step 5) is returned to.
In this embodiment, beta-sheet protein 1BQ9 with sequence length 53 is an example of a method for predicting a population protein structure based on an individual-specific variation strategy, comprising the steps of:
1) inputting sequence information of a protein to be detected, and obtaining a fragment library from a ROBETTA server (http:// www.robetta.org /);
2) setting parameters: setting the population size NP equal to 50, the crossover probability CR equal to 0.5, the fragment length l equal to 3, the temperature factor KT equal to 2, the number of neighboring individuals N equal to NP/5, and the maximum number of iterations Gmax1000, and initializing the iteration number g to 0;
3) randomly selecting fragments from a fragment library corresponding to each residue position to assemble to generate an initial conformation population P ═ C1,C2,...,CNPIn which C isiI ═ {1,2, …, NP } is the ith conformational individual in population P;
4) calculating the energy value of each conformation in the current population according to the energy function of Rosetta socre 3;
5) for each conformation C in the populationiI ∈ {1,2, …, NP } performs the following:
5.1) reduction of conformation CiConsidering the target conformation, calculating Euclidean distances between the target conformation and other NP-1 conformations according to carbon alpha atoms, and marking the distance between the target conformation and the jth conformation as dj
5.2) calculation of NP-1 distances djJ-1, 2, NP-1 average daveAnd the largest distance among the NP-1 distances is recorded as dmaxAnd the minimum distance is denoted as dmin
5.3) calculating the search State factor for the target conformation
Figure BDA0001781396740000062
5.4) randomly generating a fraction between 0 and 1
Figure BDA0001781396740000063
If it is not
Figure BDA0001781396740000064
The following operations are performed:
5.4.1) selecting the N conformations closest to the target conformation and selecting the conformation C with the lowest energy among the N conformationspbestAnd randomly selecting two adjacent constellations from the N adjacent constellations which are different from each other and are CpbestDifferent conformation CaAnd Cb
5.4.2) randomly generating a random integer R 'between 1 and 2, if R' is 1, from the constellation C, respectivelyaAnd CbWherein a fragment of length l different from the residue is randomly selected for substitution conformation CpbestFragment of the corresponding position in (1), generating a mutated conformation Cmutant
5.4.3) if R' is 2, respectively from conformation CpbestAnd CbWherein a fragment of length l different from the residue is randomly selected for substitution conformation CaFragment of the corresponding position in (1), generating a mutated conformation Cmutant
5.5) if
Figure BDA0001781396740000071
The following operations are performed:
5.5.1) randomly selecting three conformations C from the current population, which are different from each other and from the target conformationc、CdAnd Ce
5.5.2) from C, respectivelyc、CdAnd CeWherein a fragment of length l different in residue position is randomly selected to replace target conformation CiFragment of the corresponding position in (1), generating a mutated conformation Cmutant
5.6) randomly generating a decimal R between 0 and 1, if R<CR, from conformation CiWherein a fragment of length l is randomly selected to replace the mutated conformation CmutantAnd performing random fragment assembly once to generate test conformation Ctrial(ii) a Otherwise, the variant conformation is directly subjected to one-time random fragment assembly to generate a test conformation Ctrial
5.7) calculation of the test conformation C according to the Rosetta score3 energy functiontrialThe energy value of (a);
5.8) if CtrialEnergy value of less than CiEnergy value of (1), then CtrialReplacement CiOtherwise according to Boltzmann probability
Figure BDA0001781396740000072
With CtrialReplacement CiWherein Δ E is CtrialEnergy value of and CiAbsolute value of the energy value error of (a);
6) g is g +1, if g>GmaxThe conformation with the lowest energy is output as the final predicted structure, otherwise, the step 5) is returned to.
Using the example of beta-sheet protein 1BQ9 with sequence length of 53, the above method was used to obtain the near-native conformation of the protein with the minimum RMS deviation of
Figure BDA0001781396740000073
Mean root mean square deviation of
Figure BDA0001781396740000074
The prediction structure is shown in fig. 3.
The above description is the result of the protein 1BQ9 of the present invention, 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 group protein structure prediction method based on individual specific variation strategy is characterized in that: the method comprises the following steps:
1) inputting sequence information of the protein to be detected, and obtaining a fragment library from a ROBETTA server;
2) setting parameters: setting population size NP, cross probability CR, segment length l, temperature factor KT, adjacent individual number N and maximum iteration number GmaxInitializing the iteration number g to be 0;
3) randomly selecting fragments from a fragment library corresponding to each residue position to assemble to generate an initial conformation population P ═ C1,C2,...,CNPIn which C isiI ═ {1,2, …, NP } is the ith conformational individual in population P;
4) calculating the energy value of each conformation in the current population according to the energy function of Rosetta socre 3;
5) for each conformation C in the populationiI ∈ {1,2, …, NP } performs the following:
5.1) reduction of conformation CiConsidering the target conformation, calculating Euclidean distances between the target conformation and other NP-1 conformations according to carbon alpha atoms, and marking the distance between the target conformation and the jth conformation as dj
5.2) calculation of NP-1 distances djJ-1, 2, NP-1 average daveAnd the largest distance among the NP-1 distances is recorded as dmaxAnd the minimum distance is denoted as dmin
5.3) calculating the search State factor for the target conformation
Figure FDA0001781396730000011
5.4) randomly generating a fraction between 0 and 1
Figure FDA0001781396730000012
If it is not
Figure FDA0001781396730000013
The following operations are performed:
5.4.1) selecting the N conformations closest to the target conformation and selecting the conformation C with the lowest energy among the N conformationspbestAnd randomly selecting two adjacent constellations from the N adjacent constellations which are different from each other and are CpbestDifferent conformation CaAnd Cb
5.4.2) randomly generating a random integer R 'between 1 and 2, if R' is 1, from the constellation C, respectivelyaAnd CbWherein a fragment of length l different from the residue is randomly selected for substitution conformation CpbestFragment of the corresponding position in (1), generating a mutated conformation Cmutant
5.4.3) if R' is 2, respectively from conformation CpbestAnd CbWherein a fragment of length l different from the residue is randomly selected for substitution conformation CaFragment of the corresponding position in (1), generating a mutated conformation Cmutant
5.5) if
Figure FDA0001781396730000014
The following operations are performed:
5.5.1) randomly selecting three conformations C from the current population, which are different from each other and from the target conformationc、CdAnd Ce
5.5.2) from C, respectivelyc、CdAnd CeWherein a fragment of length l different in residue position is randomly selected to replace target conformation CiFragment of the corresponding position in (1), generating a mutated conformation Cmutant
5.6) randomly generating a decimal R between 0 and 1, if R<CR, from conformation CiWherein a fragment of length l is randomly selected to replace the mutated conformation CmutantAnd performing random fragment assembly once to generate test conformation Ctrial(ii) a Otherwise, the variant conformation is directly subjected to one-time random fragment assembly to generate a test conformation Ctrial
5.7) calculation of the test conformation C according to the Rosetta score3 energy functiontrialThe energy value of (a);
5.8) if CtrialEnergy value of less than CiEnergy value of (1), then CtrialReplacement CiOtherwise according to Boltzmann probability
Figure FDA0001781396730000021
With CtrialReplacement CiWherein Δ E is CtrialEnergy value of and CiAbsolute value of the energy value error of (a);
6) g is g +1, if g>GmaxThe conformation with the lowest energy is output as the final predicted structure, otherwise, the step 5) is returned to.
CN201810993742.7A 2018-08-29 2018-08-29 Group protein structure prediction method based on individual specific variation strategy Active CN109411013B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810993742.7A CN109411013B (en) 2018-08-29 2018-08-29 Group protein structure prediction method based on individual specific variation strategy

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810993742.7A CN109411013B (en) 2018-08-29 2018-08-29 Group protein structure prediction method based on individual specific variation strategy

Publications (2)

Publication Number Publication Date
CN109411013A CN109411013A (en) 2019-03-01
CN109411013B true CN109411013B (en) 2020-10-30

Family

ID=65463654

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810993742.7A Active CN109411013B (en) 2018-08-29 2018-08-29 Group protein structure prediction method based on individual specific variation strategy

Country Status (1)

Country Link
CN (1) CN109411013B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110556161B (en) * 2019-08-13 2022-04-05 浙江工业大学 Protein structure prediction method based on conformational diversity sampling

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105205348A (en) * 2015-09-22 2015-12-30 浙江工业大学 Method for colony conformation space optimization based on distance constraint selection strategy
CN106096326A (en) * 2016-06-02 2016-11-09 浙江工业大学 A kind of differential evolution Advances in protein structure prediction based on barycenter Mutation Strategy
CN106503484A (en) * 2016-09-23 2017-03-15 浙江工业大学 A kind of multistage differential evolution Advances in protein structure prediction that is estimated based on abstract convex
CN106650305A (en) * 2016-10-10 2017-05-10 浙江工业大学 Multi-strategy colony protein structure prediction method based on local abstract convexity supporting plane

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105205348A (en) * 2015-09-22 2015-12-30 浙江工业大学 Method for colony conformation space optimization based on distance constraint selection strategy
CN106096326A (en) * 2016-06-02 2016-11-09 浙江工业大学 A kind of differential evolution Advances in protein structure prediction based on barycenter Mutation Strategy
CN106503484A (en) * 2016-09-23 2017-03-15 浙江工业大学 A kind of multistage differential evolution Advances in protein structure prediction that is estimated based on abstract convex
CN106650305A (en) * 2016-10-10 2017-05-10 浙江工业大学 Multi-strategy colony protein structure prediction method based on local abstract convexity supporting plane

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
"A novel differential evolution algorithm using local abstract convex underestimate strategy for global optimization";Xiao-gen Zhou 等;《Computers & Operations Research》;20160527;第132-149页 *
"求解蛋白质结构预测问题的局部搜索算法";吕志鹏 等;《计算机科学》;20051231;第32卷(第11期);第148-151页 *
"蛋白质构象空间局部增强差分进化搜索方法";董辉 等;《计算机科学》;20151130;第42卷(第11A期);第22-26页 *

Also Published As

Publication number Publication date
CN109411013A (en) 2019-03-01

Similar Documents

Publication Publication Date Title
CN107609342B (en) Protein conformation search method based on secondary structure space distance constraint
CN109524058B (en) Protein dimer structure prediction method based on differential evolution
CN108846256B (en) Group protein structure prediction method based on residue contact information
CN109448784B (en) Protein structure prediction method based on dihedral angle information auxiliary energy function selection
Terwilliger et al. Improved crystallographic models through iterated local density-guided model deformation and reciprocal-space refinement
CN110148437A (en) A kind of Advances in protein structure prediction that contact residues auxiliary strategy is adaptive
CN109086566B (en) Group protein structure prediction method based on fragment resampling
CN109360596B (en) Protein conformation space optimization method based on differential evolution local disturbance
CN109360599B (en) Protein structure prediction method based on residue contact information cross strategy
Kmiecik et al. Towards the high-resolution protein structure prediction. Fast refinement of reduced models with all-atom force field
CN109872770B (en) Variable strategy protein structure prediction method combined with displacement degree evaluation
CN109411013B (en) Group protein structure prediction method based on individual specific variation strategy
CN109360597B (en) Group protein structure prediction method based on global and local strategy cooperation
CN109215733B (en) Protein structure prediction method based on residue contact information auxiliary evaluation
CN109360601B (en) Multi-modal protein structure prediction method based on displacement strategy
CN108920894B (en) Protein conformation space optimization method based on brief abstract convex estimation
Sun et al. Smolign: a spatial motifs-based protein multiple structural alignment method
CN109378034B (en) Protein prediction method based on distance distribution estimation
CN109346128B (en) Protein structure prediction method based on residue information dynamic selection strategy
CN108595910B (en) Group protein conformation space optimization method based on diversity index
CN109147867B (en) Group protein structure prediction method based on dynamic segment length
CN109300503B (en) Global and local lower bound estimation synergistic group protein structure prediction method
CN109448785B (en) Protein structure prediction method for enhancing Loop region structure by using Laplace graph
CN109256177B (en) Protein structure prediction method based on sub-population coevolution
CN109326318B (en) Group protein structure prediction method based on Loop region Gaussian disturbance

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