Abstract
AutoDock is a widely used simulation platform for Protein-ligand docking which is a simulator to provide the field of computer-aided drug design (CADD) with conveniences. Protein-ligand docking establishes docking models and study interaction between the receptor and the ligand, as a part of the most important means in drug development. Protein-ligand docking problem is of great significance to design more effective and ideal drugs. The experiments are simulated on AutoDock with six weighted algorithms such as Lamarckian genetic algorithm, a genetic algorithm with crossover elitist preservation, artificial bee colony algorithm, ABC_DE_based hybrid algorithm, fireworks algorithm, and monarch butterfly optimization. The diversity of search function constructed by different evolutionary algorithms for separate receptors and ligands is applied and analyzed. Performances of distinct search functions are given according to convergence speed, energy value, hypothesis test and so on. This can be of great benefit to future protein-ligand docking progress. Based on the work, appearances are found that performances of the same algorithm vary with different problems. No universal algorithms are having the best performance for diverse problems. Therefore, it is important how to choose an appropriate approach according to characteristics of problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Brooijmans, N., Kuntz, I.D.: Molecular recognition and docking algorithms. Annu. Rev. Biophys. Biomol. Struct. 32(1), 335–373 (2003)
Huang, S.Y., Zou, X.: Advances and challenges in Protein-ligand docking. Int. J. Mol. Sci. 11(8), 3016–3034 (2010)
Jug, G., Anderluh, M., Tomašič, T.: Comparative evaluation of several docking tools for docking small molecule ligands to DC-SIGN. J. Mol. Model. 21(6), 1–12 (2015)
Verlinde, C.L., Hol, W.G.: Structure-based drug design: progress, results and challenges. Structure 2(7), 577–587 (1994)
Huey, R., Morris, G.M., Olson, A.J., Goodsell, D.S.: Software news and update a semiempirical free energy force field with charge-based desolvation. J. Comput. Chem. 10, 1145–1152 (2007)
Jain, A.N.: Scoring functions for protein-ligand docking. Curr. Protein Pept. Sci. 7(5), 407–420 (2006)
Feinstein, W.P., Brylinski, M.: Calculating an optimal box size for ligand docking and virtual screening against experimental and predicted binding pockets. J. Cheminform 7, 18 (2015)
Zeng, X.X., Liao, Y.L., Liu, Y.S., Zou, Q.: Prediction and validation of disease genes using HeteSim Scores. IEEE/ACM Trans. Comput. Biol. Bioinf. 14(03), 687–695 (2017)
Cao, T., Li, T.: A combination of numeric genetic algorithm and tabu search can be applied to molecular docking. Comput. Biol. Chem. 28(4), 303–312 (2004)
Morris, G.M., et al.: Automated docking using a lamarckian genetic algorithm and an empirical binding free energy function. Comput. Chem. J. Comput. Chem 19(28), 1639–1662 (1998)
Guan, B., Zhang, C., Ning, J.: EDGA: a population evolution direction-guided genetic algorithm for protein-ligand docking. J. Comput. Biol. 23(7), 585–596 (2016)
Fuhrmann, J., Rurainsk, A., Lenhof, H.P., Neumann, D.: A new Lamarckian genetic algorithm for flexible ligang-receptor docking. J. Comput. Chem. 31, 1911–1918 (2010)
Guan, B., Zhang, C., Ning, J.: Genetic algorithm with a crossover elitist preservation mechanism for protein–ligand docking. Amb. Express 7(1), 174 (2017)
Uehara, S., Fujimoto, K.J., Tanaka, S.: Protein-ligand docking using fitness learning-based artificial bee colony with proximity stimuli. Phys. Chem. Chem. Phys. 17(25), 16412–16417 (2015)
Guan, B., Zhang, C., Zhao, Y.: An efficient ABC_DE_Based hybrid algorithm for protein-ligand docking. Int. J. Mol. Sci. 19(4), 1181 (2018)
Jiang, D., Huo, L., Song, H.: Rethinking behaviors and activities of base stations in mobile cellular networks based on big data analysis. IEEE Trans. Netw. Sci. Eng. 1(1), 1–12 (2018)
Jiang, D., Huo, L., Lv, Z., et al.: A joint multi-criteria utility-based network selection approach for vehicle-to-infrastructure networking. IEEE Trans. Intell. Transp. Syst. (99), 1–15 (2018)
Jiang, D., Zhang, P., Lv, Z., et al.: Energy-efficient multi-constraint routing algorithm with load balancing for smart city applications. IEEE Internet of Things J. 3(6), 1437–1447 (2016)
Jiang, D., Xu, Z., Li, W., et al.: Topology control-based collaborative multicast routing algorithm with minimum energy consumption. Int. J. Commun. Syst. 30(1), 1–18 (2017)
Jiang, D., Xu, Z., Li, W., et al.: An energy-efficient multicast algorithm with maximum network throughput in multi-hop wireless networks. J. Commun. Netw. 18(5), 713–724 (2016)
Tan, Y., Zhu, Y.: Fireworks algorithm for optimization. In: Tan, Y., Shi, Y., Tan, K.C. (eds.) ICSI 2010. LNCS, vol. 6145, pp. 355–364. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13495-1_44
Wang, G.G., Deb, S., Cui, Z.: Monarch butterfly optimization. Neural Comput. Appl. 31, 1–20 (2015)
Morris, G.M., et al.: AutoDock4 and AutoDockTools4: automated docking with selective receptor flexibility. Softw. News Updates 30(16), 2786–2791 (2009)
Hu, X., Balaz, S., Shelver, W.H.: A practical approach to docking of zinc metalloproteinase inhibitors. J. Mol. Graph. Model. 22(4), 293–307 (2004)
Acknowledgments
This study is funded by Shenyang Dongda Emerging Industrial Technology Research Institute.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Liu, Z., Zhang, C., Zhao, Q., Zhang, B., Sun, W. (2019). Comparative Study of Evolutionary Algorithms for Protein-Ligand Docking Problem on the AutoDock. In: Song, H., Jiang, D. (eds) Simulation Tools and Techniques. SIMUtools 2019. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 295. Springer, Cham. https://doi.org/10.1007/978-3-030-32216-8_58
Download citation
DOI: https://doi.org/10.1007/978-3-030-32216-8_58
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-32215-1
Online ISBN: 978-3-030-32216-8
eBook Packages: Computer ScienceComputer Science (R0)