CN103699816A - Monte Carlo simulation-based protein thermomechanical-analysis method - Google Patents
Monte Carlo simulation-based protein thermomechanical-analysis method Download PDFInfo
- Publication number
- CN103699816A CN103699816A CN201310686687.4A CN201310686687A CN103699816A CN 103699816 A CN103699816 A CN 103699816A CN 201310686687 A CN201310686687 A CN 201310686687A CN 103699816 A CN103699816 A CN 103699816A
- Authority
- CN
- China
- Prior art keywords
- new
- old
- tmp
- protein
- energy
- 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.)
- Granted
Links
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to the technical fields of biological computing and Monte Carlo simulation, and particularly discloses a Monte Carlo simulation-based protein thermomechanical-analysis method, which comprises the following steps of A, determining a protein energy model; B, simulating and calculating the state density of a protein system. According to the method, the whole thermomechanical process of protein folding can be efficiently analyzed and researched to further explore and research a protein folding process.
Description
Technical field
The present invention relates to biological computation and Monte Carlo simulation field, specifically disclose a kind of protein thermodynamics analytical approach based on Monte Carlo simulation.
Background technology
Protein engineering is the Disciplinary Frontiers of modern biotechnology development, and its basic goal is naturally occurring protein will be transformed according to people's imagination, or designs as required non-natural novel protein with certain specific function.And one of important foundation of this transformation and design is the prediction of protein folding structure.The form of protein folding structure has determined its biological function that may have to a great extent.In other words, between the structure of protein and function, there is consistance.Therefore to the prediction of protein folding structure and research in protein engineering, field of medicaments etc. have extremely important meaning.
Monte Carlo simulation is a kind of random search algorithm being widely used, by the particle position removal search conformational space of randomly changing protein system, the density of states of acquisition system, thereby various macroscopic properties that can computing system, and then the folding whole thermodynamic process of Study on Protein.But because protein energy space is complicated, between the local lowest region of energy value and have energy barrier between overall lowest region, the simulation at low temperatures of traditional Monte carlo algorithm is easily absorbed between the local lowest region of energy, is difficult to jump out and finds globally optimal solution.A lot of new Monte Carlo simulation algorithms have been produced thus, as many canonical ensembles (multicanonical) Monte carlo algorithm, simulated tempering (simulated tempering) algorithm, copy exchange (Replica Exchange Method) algorithm and Wang-Landau algorithm.
The basic thought of Wang-Landau algorithm is to use non-Boltzmann distribution function to realize the analog simulation of freely walking between energy range, thereby searches for more widely configuration space; Also can automatically obtain the density of states of protein system simultaneously, thereby can calculate the many cannoncial system thermodynamic quantities in broad temperature range, and then the folding whole thermodynamic process of Study on Protein.Wang-Landau is due to directly perceived succinct, and its range of application has expanded in magnetic system, liquid crystal, liquid, cluster, Spin glass model and protein folding.But Wang-Landau algorithm need further improvement in computational accuracy and speed.
Summary of the invention
The present invention is intended to overcome the defect of prior art computational accuracy and underspeed in protein thermodynamics is analyzed, and a kind of protein thermodynamics analytical approach based on Monte Carlo simulation is provided.
Technical scheme of the present invention is 1, a kind of protein thermodynamics analytical approach based on Monte Carlo simulation, it is characterized in that, comprises steps A: determine protein energy model; And B: simulation and the calculating protein system density of states.
Further, steps A further comprises: adopt ECEPP energy force field model and angle coordinate system, the expression-form in the ECEPP energy field of force is:
E
ECEPP=E
C+E
LJ+E
HB+E
Tor
Wherein
the coulomb acting force between two electric charges, r
ijrepresent the distance between atom i and j,
the Lan Na-Jones acting force between two atoms,
hyarogen-bonding, E
tor=∑
lu
l(1 ± cos (n
lξ
l)) be dihedral turning effort power, ξ
ll dihedral.
Further, steps A further comprises: to carrying out discretize processing between used protein energy range, if get k energy bin interval value, need [E
min, E
max] on average divide k bin interval, with each interval middle energy value, represent this energy interval value.
Further, step B further comprises: by the MPI concurrent program algorithm of principal and subordinate's process mode, and the density of states of simulation and calculating protein system.
Further, in N minute process of described principal and subordinate's process mode, a minute process 1 is host process, and within all the other minute, process is subprocess.
Further, described host process comprises the following steps:
S11: logarithm S (the E)=lng (E)=0 of initialization protein system Density function, histogram H (E)=0(E
min≤ E≤E
max), s=1, modifying factor df|
e=(κ Θ (E
0-E)+1) lnf, wherein Θ (E
0-E) be Heaviside piecewise function, κ, E
0, f is the parameter that is relevant to model;
S12:t=1;
S13: in host process, original configuration is carried out to random fluctuation, produce new configuration, calculating energy E
new, according to Metropolis criterion, determine the received probability of new configuration, t=t+1, s=s+1, modifying factor is df|
e=(κ Θ (E
0-E)+1) lnf;
Step S13 circulation tmax time;
S14: all process intercommunications, host process is collected all S from process
tmpand H (E)
tmp(E) and accumulation calculating go out overall S (E) and H (E), the overall situation S (E)=S (E)+all S from process
tmp(E), H (E)=H (E)+all H from process of the overall situation
tmp(E), being broadcast to of overall S (E) and H (E) is all from process, try to achieve H
real(E)=H (E) * [1+ κ Θ (E
0-E)], the mild condition of judgement histogram:
If do not meet, turn back to S12 and continue iteration; If satisfied to S15;
S15: change modifying factor f, then return and carry out S12 continuation iteration, until satisfy condition
Δ E=E wherein
max-E
minenergy range for system;
S16: once satisfy condition
original configuration is carried out to random fluctuation, produce new configuration, calculating energy E
new, according to Metropolis criterion, determine the received probability of new configuration, s=s+1, modifying factor is
S17: continue S16 iteration, until meet procedure termination condition
by the S of all processes (E) is averaging
?
and then obtain the relative density of states of protein system
Further, describedly from process, comprise the following steps:
S21: logarithm S (the E)=lng (E)=0 of the density of states of initialization system, S
tmp(E)=lng
tmp(E)=0, histogram H (E)=0, H
tmp(E)=0 (E
min≤ E≤E
max), s=1, modifying factor df|
e=(κ Θ (E
0-E)+1) lnf, wherein Θ (E
0-E) be Heaviside piecewise function, κ, E
0, f is the parameter that is relevant to model;
S22:t=1;
S23: from process, original configuration is carried out to random fluctuation, produce new configuration, calculating energy E
new, according to Metropolis criterion, determine the received probability of new configuration, t=t+1, s=s+1, modifying factor is df|
e=(κ Θ (E
0-E)+1) lnf;
Step S23 circulation tmax time;
S24: all process intercommunications, from process by S
tmpand H (E)
tmp(E) send to host process, then receive the overall S (E) and the H (E) that through host process, calculate and upgrade original S (E) and H (E), by S
tmpand H (E)
tmp(E) be initialized as 0, try to achieve H
real(E)=H (E) * [1+ κ Θ (E
0-E)], the mild condition of judgement histogram:
If do not meet, return and carry out S22 continuation iteration; If satisfied perform step S25;
S25 changes modifying factor f, then returns and carry out S22 continuation iteration, until satisfy condition
Δ E=E wherein
max-E
minenergy range for system;
S26: once condition
meet, original configuration is carried out to random fluctuation, produce new configuration, calculating energy E
new, according to Metropolis criterion, determine the received probability of new configuration;
Further, in step S13, according to Metropolis criterion, determine that the received probability of new configuration further comprises:
If accept new configuration:
S(E
new)=S(E
new)+df|
E,H(E
new)=H(E
new)+1;
Otherwise:
S(E
old)=S(E
old)+df|
E,H(E
old)=H(E
old)+1。
Further, in step S23, according to Metropolis criterion, determine that the received probability of new configuration further comprises:
If accept new configuration:
S(E
new)=S(E
new)+df|
E,H(E
new)=H(E
new)+1,
S
tmp(E
new)=S
tmp(E
new)+df|
E,H
tmp(E
new)=H
tmp(E
new)+1;
Otherwise:
S(E
old)=S(E
old)+df|
E,H(E
old)=H(E
old)+1,
S
tmp(E
old)=S
tmp(E
old)+df|
E,H
tmp(E
old)=H
tmp(E
old)+1。
Further, in step S16 and S26, according to Metropolis criterion, determine that the received probability of new configuration further comprises:
If accept new configuration:
Otherwise:
Further, in step S15 and S25, change modifying factor f mode is:
Repeatedly repeat aforesaid way.
Compare with classical Wang-Landau algorithm, the present invention uses the modifying factor stage by stage with overall regeneration characteristics, can accelerate search and analog rate; Utilize the mode of renewal modifying factor flexibly of annealing (Annealing) mechanism can improve simulation precision and speed; Adopt the parallel mode of this algorithm can greatly accelerate search and analog rate.Based on method provided by the invention, can efficient analysis and the folding whole thermodynamic process of Study on Protein, and then protein folding procedure is explored and studied.
Accompanying drawing explanation
Fig. 1 is the process flow diagram of the protein thermodynamics analytical approach based on Monte Carlo simulation of the present invention.
Fig. 2 is the parallel algorithm process flow diagram of the density of states of simulation and calculating protein system.
Embodiment
In order to make object of the present invention, technical scheme and advantage clearer, below in conjunction with drawings and Examples, the present invention is further elaborated.Should be appreciated that specific embodiment described herein, only in order to explain the present invention, is not intended to limit the present invention.
In addition,, in each embodiment of described the present invention, involved technical characterictic just can not combine mutually as long as do not form each other conflict.
The invention provides a kind of protein thermodynamics analytical approach based on Monte Carlo simulation, with reference to figure 1, the method is shown and mainly comprises two basic steps: steps A is determined protein energy model; And step B simulation and the calculating protein system density of states.
In steps A, can adopt ECEPP energy force field model and angle coordinate system.Wherein the expression-form in the ECEPP energy field of force is:
E
ECEPP=E
C+E
LJ+E
HB+E
Tor
Wherein,
the coulomb acting force between two electric charges, r
ijrepresent the distance between atom i and j,
the Lan Na-Jones acting force between two atoms,
hyarogen-bonding, E
tor=∑
lu
l(1 ± cos (n
lξ
l)) be dihedral turning effort power, ξ
ll dihedral.Because the ECEPP energy field of force adopts angle coordinate system, so counting yield is higher than the energy field of force based on cartesian coordinate system.
For the ease of computer simulation emulation, can also, to carrying out discretize processing between used protein energy range, if get k energy bin interval value, need [E
min, E
max] on average divide k bin interval, with each interval middle energy value, represent this energy interval value.
In step B, by the MPI concurrent program algorithm of principal and subordinate's process mode, the density of states of simulation and calculating protein system.In N minute process of described principal and subordinate's process mode, a minute process 1 is host process, and within all the other minute, process is subprocess.
With reference to figure 2, the parallel algorithm process flow diagram of the density of states of simulation and calculating protein system is shown.As can be seen from Fig. 2,
host process comprises the following steps:
S11: logarithm S (the E)=lng (E)=0 of the density of states of initialization system, histogram H (E)=0(E
min≤ E≤E
max), s=1, modifying factor df|
e=(κ Θ (E
0-E)+1) lnf, wherein Θ (E
0-E) be Heaviside piecewise function, κ, E
0, f is the parameter that is relevant to model, as desirable κ=5, E
0=-2, f=e.
S12:t=1。
S13: in host process, original configuration is carried out to random fluctuation, produce new configuration, calculating energy E
new, according to Metropolis criterion, determine the received probability of new configuration: (referred to as MCS-f step, t=t+1, s=s+1, modifying factor is df|
e=(κ Θ (E
0-E)+1) lnf)
If accept new configuration: S (E
new)=S (E
new)+df|
e, H (E
new)=H (E
new)+1;
Otherwise: S (E
old)=S (E
old)+df|
e, H (E
old)=H (E
old)+1.
Tmax (as 100 times) MCS-f step of step S13 circulation.
S14: all process intercommunications, host process is collected all S from process
tmpand H (E)
tmp(E) and accumulation calculating go out overall S (E) and H (E), the overall situation S (E)=S (E)+all S from process
tmp(E), H (E)=H (E)+all H from process of the overall situation
tmp(E).Then being broadcast to of overall S (E) and H (E) is all from process, then try to achieve H
real(E)=H (E) * [1+ κ Θ (E
0-E)], finally judge the mild condition of histogram:
If do not meet, turn back to S12 and continue iteration; If satisfied to S15.
S15: change modifying factor f, then turn back to S12 continuation iteration, until satisfy condition
(Δ E=E wherein
max-E
minenergy range for system).Changing modifying factor f mode can be: first carry out continuously the f=f of N iteration
α(0< α <1), then carry out 1 iteration
repeatedly repeat this mode.
S16: once condition
meet, original configuration is carried out to random fluctuation, produce new configuration, calculating energy E
new, according to Metropolis criterion, determine the received probability of new configuration: (referred to as MCS-s step, s=s+1, modifying factor is
)
If accept new configuration:
Otherwise:
S17: continue S16 and continue iteration, until meet procedure termination condition
(
as
desirable 0.0001), so just can be by the S of all processes (E) be averaging
?
and then obtain the relative density of states of protein system
from process, comprise the following steps:
S21: logarithm S (the E)=lng (E)=0 of the density of states of initialization system, S
tmp(E)=lng
tmp(E)=0, histogram H (E)=0, H
tmp(E)=0 (E
min≤ E≤E
max), s=1, modifying factor df|
e=(κ Θ (E
0-E)+1) lnf, wherein Θ (E
0-E) be Heaviside piecewise function, κ, E
0, f is the parameter that is relevant to model, as desirable κ=5, E
0=-2, f=e.
S22:t=1。
S23: from process, original configuration is carried out to random fluctuation, produce new configuration, calculating energy E
new, according to Metropolis criterion, determine the received probability of new configuration: (referred to as MCS-f step, t=t+1, s=s+1, modifying factor is df|
e=(κ Θ (E
0-E)+1) lnf)
If accept new configuration:
S(E
new)=S(E
new)+df|
E,H(E
new)=H(E
new)+1,
S
tmp(E
new)=S
tmp(E
new)+df|
E,H
tmp(E
new)=H
tmp(E
new)+1;
Otherwise:
S(E
old)=S(E
old)+df|
E,H(E
old)=H(E
old)+1,
S
tmp(E
old)=S
tmp(E
old)+df|
E,H
tmp(E
old)=H
tmp(E
old)+1。
Tmax (as 100 times) MCS-f step of step S23 circulation.
S24: all process intercommunications, from process by S
tmpand H (E)
tmp(E) send to host process, then receive the overall S (E) and the H (E) that through host process, calculate and upgrade original S (E) and H (E), then by S
tmpand H (E)
tmp(E) be initialized as 0, then try to achieve H
real(E)=H (E) * [1+ κ Θ (E
0-E)], finally judge the mild condition of histogram:
If do not meet, turn back to S22 and continue iteration; If satisfied to S25.
S25: change modifying factor f, then turn back to S22 continuation iteration, until satisfy condition
(Δ E=E wherein
max-E
minenergy range for system).Changing modifying factor f mode can be: first carry out continuously the f=f of N iteration
α(0< α <1), then carry out 1 iteration
repeatedly repeat this mode.
S26: once satisfy condition
original configuration is carried out to random fluctuation, produce new configuration, calculating energy E
new, according to Metropolis criterion, determine the received probability of new configuration: (referred to as MCS-s step, s=s+1, modifying factor is
)
If accept new configuration:
Otherwise:
The present invention uses the protein thermodynamics analytical approach based on Monte Carlo simulation, can effectively simulate and calculate the protein system density of states, thereby just can calculate the many canonical ensemble thermodynamic quantities in broad temperature range, the whole thermodynamic process that so just energy Study on Protein folds, and then protein folding procedure is explored and studied.
Compare with classical Wang-Landau algorithm, method of the present invention has the modifying factor stage by stage of overall regeneration characteristics can accelerate search and analog rate; Utilize the mode of renewal modifying factor flexibly of annealing (Annealing) mechanism can improve simulation precision and speed; Adopt the parallel mode of this algorithm can greatly accelerate search and analog rate.Can efficient analysis and the folding whole thermodynamic process of Study on Protein based on this, and then protein folding procedure is explored and studied, and can promote the use of the high efficiency technical in a lot of fields.
One of ordinary skill in the art will appreciate that all or part of step in the whole bag of tricks of embodiment is to come the hardware that instruction is relevant to complete by program, this program can be stored in a computer-readable recording medium, storage medium can comprise: ROM (read-only memory) (ROM, Read Only Memory), random access memory (RAM, Random Access Memory), disk or CD etc.
The above the specific embodiment of the present invention, does not form limiting the scope of the present invention.Various other corresponding changes and distortion that any technical conceive according to the present invention has been done, all should be included in the protection domain of the claims in the present invention.
Claims (10)
1. the protein thermodynamics analytical approach based on Monte Carlo simulation, is characterized in that, comprises step
A: determine protein energy model; And
B: simulation and the calculating protein system density of states.
2. protein thermodynamics analytical approach as claimed in claim 1, wherein, steps A further comprises:
Adopt ECEPP energy force field model and angle coordinate system, the expression-form in the ECEPP energy field of force is:
E
ECEPP=E
C+E
LJ+E
HB+E
Tor
3. protein thermodynamics analytical approach as claimed in claim 1, wherein, steps A further comprises:
To carrying out discretize processing between used protein energy range, if get k energy bin interval value, need [E
min, E
max] on average divide k bin interval, with each interval middle energy value, represent this energy interval value.
4. protein thermodynamics analytical approach as claimed in claim 1, wherein, step B further comprises:
By the MPI concurrent program algorithm of principal and subordinate's process mode, the density of states of simulation and calculating protein system.
5. protein thermodynamics analytical approach as claimed in claim 4, wherein, in N minute process of described principal and subordinate's process mode, a minute process 1 is host process, within all the other minute, process is subprocess.
6. protein thermodynamics analytical approach as claimed in claim 5, wherein, described host process comprises step:
S11: logarithm S (the E)=lng (E)=0 of initialization protein system Density function, histogram H (E)=0(E
min≤ E≤E
max), s=1, modifying factor df|
e=(κ Θ (E
0-E)+1) lnf, wherein Θ (E
0-E) be Heaviside piecewise function, κ, E
0, f is the parameter that is relevant to model;
S12:t=1;
S13: in host process, original configuration is carried out to random fluctuation, produce new configuration, calculating energy E
new, according to Metropolis criterion, determine the received probability of new configuration, t=t+1, s=s+1, modifying factor is df|
e=(κ Θ (E
0-E)+1) lnf;
Step S13 circulation tmax time;
S14: all process intercommunications, host process is collected all S from process
tmpand H (E)
tmp(E) and accumulation calculating go out overall S (E) and H (E), the overall situation S (E)=S (E)+all S from process
tmp(E), H (E)=H (E)+all H from process of the overall situation
tmp(E), being broadcast to of overall S (E) and H (E) is all from process, try to achieve H
real(E)=H (E) * [1+ κ Θ (E
0-E)], the mild condition of judgement histogram:
If do not meet, turn back to S12 and continue iteration; If satisfied to S15;
S15: change modifying factor f, then return and carry out S12 continuation iteration, until satisfy condition
Δ E=E wherein
max-E
minenergy range for system;
S16: once satisfy condition
original configuration is carried out to random fluctuation, produce new configuration, calculating energy E
new, according to Metropolis criterion, determine the received probability of new configuration, s=s+1, modifying factor is
7. protein thermodynamics analytical approach as claimed in claim 6, wherein, describedly comprises step from process:
S21: logarithm S (the E)=lng (E)=0 of the density of states of initialization system, S
tmp(E)=lng
tmp(E)=0, histogram H (E)=0, H
tmp(E)=0 (E
min≤ E≤E
max), s=1, modifying factor df|
e=(κ Θ (E
0-E)+1) lnf, wherein Θ (E
0-E) be Heaviside piecewise function, κ, E
0, f is the parameter that is relevant to model;
S22:t=1;
S23: from process, original configuration is carried out to random fluctuation, produce new configuration, calculating energy E
new, according to Metropolis criterion, determine the received probability of new configuration, t=t+1, s=s+1, modifying factor is df|
e=(κ Θ (E
0-E)+1) lnf;
Step S23 circulation tmax time;
S24: all process intercommunications, from process by S
tmpand H (E)
tmp(E) send to host process, then receive the overall S (E) and the H (E) that through host process, calculate and upgrade original S (E) and H (E), by S
tmpand H (E)
tmp(E) be initialized as 0, try to achieve H
real(E)=H (E) * [1+ κ Θ (E
0-E)], the mild condition of judgement histogram:
If do not meet, return and carry out S22 continuation iteration; If satisfied perform step S25;
S25 changes modifying factor f, then returns and carry out S22 continuation iteration, until satisfy condition
Δ E=E wherein
max-E
minenergy range for system;
S26: once condition
meet, original configuration is carried out to random fluctuation, produce new configuration, calculating energy E
new, according to Metropolis criterion, determine the received probability of new configuration;
8. protein thermodynamics analytical approach as claimed in claim 7, wherein,
In step S13, according to Metropolis criterion, determine that the received probability of new configuration further comprises:
If accept new configuration:
S(E
new)=S(E
new)+df|
E,H(E
new)=H(E
new)+1;
Otherwise:
S(E
old)=S(E
old)+df|
E,H(E
old)=H(E
old)+1;
In step S23, according to Metropolis criterion, determine that the received probability of new configuration further comprises:
If accept new configuration:
S(E
new)=S(E
new)+df|
E,H(E
new)=H(E
new)+1,
S
tmp(E
new)=S
tmp(E
new)+df|
E,H
tmp(E
new)=H
tmp(E
new)+1;
Otherwise:
S(E
old)=S(E
old)+df|
E,H(E
old)=H(E
old)+1,
S
tmp(E
old)=S
tmp(E
old)+df|
E,H
tmp(E
old)=H
tmp(E
old)+1。
9. protein thermodynamics analytical approach as claimed in claim 8, wherein, in step S16 and S26, according to Metropolis criterion, determine that the received probability of new configuration further comprises:
If accept new configuration:
Otherwise:
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201310686687.4A CN103699816B (en) | 2013-12-12 | 2013-12-12 | Monte Carlo simulation-based protein thermomechanical-analysis method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201310686687.4A CN103699816B (en) | 2013-12-12 | 2013-12-12 | Monte Carlo simulation-based protein thermomechanical-analysis method |
Publications (2)
Publication Number | Publication Date |
---|---|
CN103699816A true CN103699816A (en) | 2014-04-02 |
CN103699816B CN103699816B (en) | 2017-02-08 |
Family
ID=50361343
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201310686687.4A Active CN103699816B (en) | 2013-12-12 | 2013-12-12 | Monte Carlo simulation-based protein thermomechanical-analysis method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN103699816B (en) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104268120A (en) * | 2014-09-26 | 2015-01-07 | 安徽大学 | Monte carlo simulation parallel computing method for kinetic process of polymerization reaction |
CN105740573A (en) * | 2016-03-02 | 2016-07-06 | 苏州网颢信息科技有限公司 | Double-step Monte Carlo simulation method applied to radioactive ray dose computation |
CN106548040A (en) * | 2016-09-26 | 2017-03-29 | 北京理工大学 | A kind of method of the intrinsic unordered Protein Polymorphism structure of statistical computation |
CN107239352A (en) * | 2017-05-31 | 2017-10-10 | 北京科技大学 | The communication optimization method and its system of a kind of dynamics Monte Carlo Parallel Simulation |
-
2013
- 2013-12-12 CN CN201310686687.4A patent/CN103699816B/en active Active
Non-Patent Citations (4)
Title |
---|
吕志鹏: "蛋白质结构预测的现实求解方法", 《中国博士学位论文全文数据库 基础科学辑》 * |
张朋飞 等: "Wang-Landau算法在均聚物单链系统中的应用", 《南开大学学报(自然科学版)》 * |
彭丰斌 等: "基于并行群体模拟退火算法的蛋白质折叠研究", 《科研信息化技术与应用》 * |
彭丰斌: "蛋白质折叠高效蒙特卡洛模拟方法研究", 《中国优秀硕士学位论文全文数据库 基础科学辑》 * |
Cited By (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104268120A (en) * | 2014-09-26 | 2015-01-07 | 安徽大学 | Monte carlo simulation parallel computing method for kinetic process of polymerization reaction |
CN104268120B (en) * | 2014-09-26 | 2017-04-12 | 安徽大学 | Monte carlo simulation parallel computing method for kinetic process of polymerization reaction |
CN105740573A (en) * | 2016-03-02 | 2016-07-06 | 苏州网颢信息科技有限公司 | Double-step Monte Carlo simulation method applied to radioactive ray dose computation |
CN105740573B (en) * | 2016-03-02 | 2019-10-11 | 苏州网颢信息科技有限公司 | A kind of two-step Monte-carlo Simulation Method calculated for dose radiation |
CN106548040A (en) * | 2016-09-26 | 2017-03-29 | 北京理工大学 | A kind of method of the intrinsic unordered Protein Polymorphism structure of statistical computation |
CN106548040B (en) * | 2016-09-26 | 2019-04-16 | 北京理工大学 | A method of statistics calculates intrinsic unordered Protein Polymorphism structure |
CN107239352A (en) * | 2017-05-31 | 2017-10-10 | 北京科技大学 | The communication optimization method and its system of a kind of dynamics Monte Carlo Parallel Simulation |
CN107239352B (en) * | 2017-05-31 | 2019-11-29 | 北京科技大学 | The communication optimization method and its system of a kind of dynamics Monte Carlo Parallel Simulation |
Also Published As
Publication number | Publication date |
---|---|
CN103699816B (en) | 2017-02-08 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Vinitsky et al. | Benchmarks for reinforcement learning in mixed-autonomy traffic | |
Faller | Automatic coarse graining of polymers | |
Pross | Toward a general theory of evolution: Extending Darwinian theory to inanimate matter | |
Clementi | Coarse-grained models of protein folding: toy models or predictive tools? | |
Liwo et al. | A unified coarse-grained model of biological macromolecules based on mean-field multipole–multipole interactions | |
CN103699816A (en) | Monte Carlo simulation-based protein thermomechanical-analysis method | |
Harmalkar et al. | Advances to tackle backbone flexibility in protein docking | |
Lyubartsev et al. | Systematic hierarchical coarse-graining with the inverse Monte Carlo method | |
Hug | Classical molecular dynamics in a nutshell | |
ES2440415B1 (en) | METHOD AND SIMULATION SYSTEM BY MEANS OF MOLECULAR DYNAMICS WITH STABILITY CONTROL | |
Zhou et al. | Born–Oppenheimer ab initio QM/MM molecular dynamics simulations of enzyme reactions | |
Schlick | Time-trimming tricks for dynamic simulations: splitting force updates to reduce computational work | |
Mazur | Hierarchy of fast motions in protein dynamics | |
Liang et al. | Surrogate-assisted cooperative signal optimization for large-scale traffic networks | |
Wittenbrink et al. | Toward spin–orbit coupled diabatic potential energy surfaces for methyl iodide using effective relativistic coupling by asymptotic representation | |
Ghalwash et al. | Early diagnosis and its benefits in sepsis blood purification treatment | |
Wu et al. | Performance comparison of energy-aware task scheduling with GA and CRO algorithms in cloud environment | |
Su et al. | Parallel direct simulation Monte Carlo computation using CUDA on GPUs | |
Liu et al. | Hierarchical energy management of plug-in hybrid electric trucks based on state-of-charge optimization | |
Li et al. | A systematic procedure to build a relaxed dense-phase atomistic representation of a complex amorphous polymer using a coarse-grained modeling approach | |
CN103902851B (en) | The analysis method of senile dementia pathogenesis based on random optimization | |
Alur et al. | Relating average and discounted costs for quantitative analysis of timed systems | |
Todorov et al. | A new quantum stochastic tunnelling optimisation method for protein–ligand docking | |
Zhao et al. | Hybrid Model for Method for Short‐Term Traffic Flow Prediction Based on Secondary Decomposition Technique and ELM | |
CN103729577A (en) | Protein thermodynamic analysis high-efficiency stochastic simulation method based on hybrid parallel mode |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C14 | Grant of patent or utility model | ||
GR01 | Patent grant |