1 Computational Biophysics and Drug Design Jung-Hsin Lin ( 林林林 ) Division of Mechanics, Research Center for Appli ed Sciences & Institute of Biomedical Sciences, Academia Sinica School of Pharmacy, National Taiwan University http://rx.mc.ntu.edu.tw/~jlin/ 2007/3/8 NCTU IoP Semina r
37
Embed
1 Computational Biophysics and Drug Design Jung-Hsin Lin ( 林榮信 ) Division of Mechanics, Research Center for Applied Sciences & Institute of Biomedical.
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
1
Computational Biophysics and Drug Design
Jung-Hsin Lin (林榮信 )
Division of Mechanics, Research Center for Applied Sciences & Institute of Biomedical Sciences,
Academia Sinica
School of Pharmacy, National Taiwan Universityhttp://rx.mc.ntu.edu.tw/~jlin/
2007/3/8 NCTU IoP Seminar
22007/3/8 NCTU IoP Seminar
Many roles of computation in drug discovery
־ better efficiency
־ lower cost
־ better affinity to the target
־ better selectivity
־ better solubility
־ better oral availability
־ better permeability
־ better bioavailability
־ better metabolites
־ no conflict of interests
Computation can be helpful for discovering new drugs with
Best HypoGen pharmacophore model Hypo1 aligned to compound 1
132007/3/8 NCTU IoP Seminar
y = 0.7456x + 2.0334
R2 = 0.751
3
4
5
6
7
8
9
10
11
3 4 5 6 7 8 9 10 11
measured activity (-logKi)
estim
ated
act
ivity
(-log
Ki)
Correlation Plot
142007/3/8 NCTU IoP Seminar
Pharmacophore model for A2A agonists
Best HypoGen pharmacophore model Hypo2 aligned to compound 33
152007/3/8 NCTU IoP Seminar
Correlation Table
162007/3/8 NCTU IoP Seminar
Correlation Plot
y = 0.9935x
R2 = 0.8716
3
4
5
6
7
8
9
10
3 4 5 6 7 8 9 10
measured activity (-logKi)
estim
ated
act
ivity
(-log
Ki)
172007/3/8 NCTU IoP Seminar
Model from GPCR DB
182007/3/8 NCTU IoP Seminar
Model from ModBase
19
A Novel Global Optimization Algorithm for Protein-Ligand
Interactions Jung-Hsin Lin (林榮信 )
Tien-Hao Chang (張天豪 )Yen-Jen Oyang (歐陽彥
正 )
202007/3/8 NCTU IoP Seminar
Characteristics of Biological Complex Problems
• The potential energy function is extremely rugged.
• The potential energy surface is usually highly asymmetric.
• The true global minimum is often surrounded by many deceptive local minima.
• The biological complex problems are mostly in the space of high dimensionality.
212007/3/8 NCTU IoP Seminar
The Flexible Docking Problem
222007/3/8 NCTU IoP Seminar
Thermodynamic Process of Docking
232007/3/8 NCTU IoP Seminar
AutoDock Scoring Function
A free energy-based empirical approach.
soltorelechbondvdw GGGGGG
22 2
,
,
,1012
,612
)(
)(
ijr
jiijjisolsol
tortortor
ji ijij
jielecelec
jihbond
ij
ij
ij
ijhbondhbond
ji ij
ij
ij
ijvdwvdw
eVSVSWG
NWG
rr
qqWG
Er
D
r
CtEWG
r
B
r
AWG
Dobs KRTG ln
J. Comput. Chem. 19: 1639-1662 (1998)
242007/3/8 NCTU IoP Seminar
Searching is Generally a Global Optimization Problem
Usually there is no general solution. Most heuristics cannot guarantee the optimal
solution. Some of them have been classified as NP-
complete or NP-hard problem.
252007/3/8 NCTU IoP Seminar
How to explore the phase space?(Or, how to find a needle in a haystack?)
---Importance sampling
We should only explore the important region of the phase space, not the entire phase space.
Stochastic methods usually outperform deterministic approaches in higher dimensional space.
262007/3/8 NCTU IoP Seminar
Genetic Algorithm
1.[Start] Generate random population of n chromosomes (suitable solutions for the problem)
2.[Fitness] Evaluate the fitness f(x) of each chromosome x in the population
3.[New population] Create a new population by repeating following steps until the new population is complete a.[Selection] Select two parent chromosomes from a
population according to their fitness (the better fitness, the bigger chance to be selected)
b.[Crossover] With a crossover probability cross over the parents to form new offspring (children). If no crossover was performed, offspring is the exact copy of parents.
c.[Mutation] With a mutation probability mutate new offspring at each locus (position in chromosome).
d.[Accepting] Place new offspring in the new population 4.[Replace] Use new generated population for a further run of
the algorithm 5.[Test] If the end condition is satisfied, stop, and return the
best solution in current population 6.[Loop] Go to step 2
272007/3/8 NCTU IoP Seminar
Chromosomes for Flexible Docking
Crossover operation
Leach, 2001.
282007/3/8 NCTU IoP Seminar
Lamarckian Genetic Algorithm
LGA is a hybrid of the Genetic Algorithm with the adaptive local search method.
As in the GA scheme, energy is regarded as the phenotype, and the compound conformation and location are regarded as the genotype.
In the LGA scheme, phenotype is modified by the local searcher, and then the genotype is modified by the locally optimized phenotype.
In AutoDock, the so-called Solis-Wet algorithm is used (basically energy-based random move).
292007/3/8 NCTU IoP Seminar
The Rank-based Adaptive Mutation Evolutionary Algorithm
• n individuals, denoted by s1, s2, …, sn, are generated. Each si is a vector corresponding to a point in the domain of the objective function f . In order to achieve a scale-free representation, each component of si is linearly mapped to the numerical range of [0,1].
• The individuals in each generation of population are then sorted in the ascending order based on the values of the energy function on evaluated on these individuals. Let t1, t2, … tn denote the ordered individuals and we have f(t1) < f(t2) < f(tn).
• n Gaussian distributions, denoted by G1, G2, … Gn, are generated before the new generation of population is created. The center of each Gaussian distribution is selected randomly and independently from t1, t2, … tn, where the probability is not uniform but instead follows a discrete diminishing distribution, n : n-1 : … : 1.
• Our new RAME algorithm can find out the global minima for complex potential functions below dimensionality of 30 with substantial finite probability, which is suitable for most docking applications.
• The RAME algorithm avoids the “purification” effect inherent in the genetic algorithm and its derivatives, and therefore reduce the over-compression of information in the searching process.