|
In the past two decades, structure-based drug design has received increasing attention from research institutions and the pharmaceutical industry. Traditionally, each new drug requires 6-12 years to bring it from discovery to market. Such a lengthy drug discovery process is actually composed of several steps. These steps include finding good starting molecular structures for optimization, refining the starting molecular structures to generate potential drugs, biologically testing potential drugs generated from previous steps and testing new drugs clinically. Each step mentioned above needs 1-3 years to complete by traditional techniques. It is worth mentioning that the first step, finding good starting molecular structures for optimization is one of the key issues to improve drug discovery process and can be assisted by computers. Actually, structure-based drug design is one of the revolutionary approaches that help to find good starting molecular structures of potential drugs using computer graphics techniques and computational algorithms.
Molecular binding problem, one of the most important problems in structure-based drug design, can be formulated as a global energy optimization problem of molecular mechanics. Nevertheless, the formulated problem is an NP problem with a very complicated scoring function, and so it is hard to find feasible solutions efficiently no matter what methods are applied. Therefore, in the past, many researchers proposed various approaches to address the molecular binding problem, including human-machine interaction approach (virtual reality), quantitative structure-activity relationship(QSAR) and computational approach. In this proposal, various novel computational algorithms different from previous works are proposed to address the molecular binding problem. The algorithms are derived from genetic algorithms(GA) plus simulated annealing(SA) hybrid techniques, namely population-based annealing genetic algorithms(PAG). GA and SA are two powerful stochastic techniques for solving global optimization problems approximately. However, both techniques suffer from efficiency or solution quality problems. PAG combines SA with GA in order to reduce the weaknesses and incorporates the strengths of both methods. Both empirical and analytical evidence show that PAG is an efficient method to solve global optimization problems. We have applied PAG to find binding structures for three drug-protein molecular complex. The proteins examined are dihydrofolate reductase enzyme(DHFR), thermolysin(TLN) and Human Immunodeficiency Virus-1 Protease(HIV-1). One of the three drugs docking with DHFR is an anti-cancer drug methotrexate(MTX) and the other two are analogue of antibacterial drug trimethoprim. In the latter two proteins, the crystal ligands, getting from Protein Data Bank(PDB), are redocked. All of the binding results not only keep the energy low, but also have a promising binding geometrical structure.
|