Abstract
Molecular simulation docking has become an important contribution to pharmaceutical research. However, in the case of fast screening of many substances (ligands) for their potential impact on a pathogenic protein, computation time is a serious issue. This paper presents a technique to reduce the search space by keeping the ligands close to the surface of the protein.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kuhn, D.: Reduktion der Suchraumgröße bei der Simulation von Protein-Ligand-Wechselwirkungen am Beispiel von AutoDock. Master’s thesis, HTWK Leipzig, Leipzig (2007)
Lam, P.Y., Jadhav, P.K., Eyermann, C.J., Hodge, C.N., Ru, Y., Bacheler, L.T., Meek, J.L., Otto, M.J., Rayner, M.M., Wong, Y.N.: Rational design of potent, bioavailable, nonpeptide cyclic ureas as hiv protease inhibitors. Science 263(5145), 380–384 (1994)
Marquart, M., Walter, J., Deisenhofer, J., Bode, W., Huber, R.: The geometry of the reactive site and of the peptide groups in trypsin, trypsinogen and its complexes with inhibitors. Acta Crystallographica Section B 39(4), 480–490 (1983), http://dx.doi.org/10.1107/S010876818300275X
Moitessier, N., Englebienne, P., Lee, D., Lawandi, J., Corbeil, C.R.: Towards the development of universal, fast and highly accurate docking/scoring methods: a long way to go. British Journal of Pharmacology 153(S1), S7–S26 (2008)
Morris, G.M., Goodsell, D.S., Halliday, R.S., Huey, R., Hart, W.E., Belew, R.K., Olson, A.J.: Automated docking using a lamarckian genetic algorithm and an empirical binding free energy function. Journal of Computational Chemistry 19, 1639–1662 (1998)
Namasivayam, V., Günther, R.: pso@autodock: A fast flexible molecular docking program based on swarm intelligence. Chemical Biology & Drug Design 70(6), 475–484 (2007)
Rechenberg, I.: Evolutionsstrategie 1994. Frommann-Holzboog, Stuttgart (1994)
Schwefel, H.P.: Evolution and Optimum Seeking. Wiley & Sons, New York (1995)
Solis, F.J., Wets, R.J.: Minimization by random search techniques. Mathematics of operations research 6(1), 19–30 (1981)
Stouten, P.F.W., Frömmel, C., Nakamura, H., Sander, C.: An effective solvation term based on atomic occupancies for use in protein simulations. Molecular Simulation 10(2-6), 97–120 (1993)
Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. on Evolutionary Computation 1(1), 67–82 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuhn, D., Günther, R., Weicker, K. (2009). A Novel Approach to Reduce High-Dimensional Search Spaces for the Molecular Docking Problem. In: Mehnen, J., Köppen, M., Saad, A., Tiwari, A. (eds) Applications of Soft Computing. Advances in Intelligent and Soft Computing, vol 58. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89619-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-89619-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89618-0
Online ISBN: 978-3-540-89619-7
eBook Packages: EngineeringEngineering (R0)