A Novel Fireworks Algorithm for the Protein-Ligand Docking on the AutoDock

The AutoDock is a widely used protein-ligand docking simulation platform which is a simulator to bring the field of computer-aided drug design (CADD) conveniences. The protein-ligand docking problem is of great significance to design more effective and ideal drugs. In order to solve the protein-liga...

Full description

Saved in:
Bibliographic Details
Published in:Mobile networks and applications 2021-04, Vol.26 (2), p.657-668
Main Authors: Liu, Zhuoran, Jiang, Dingde, Zhang, Changsheng, Zhao, Haitong, Zhao, Qidong, Zhang, Bin
Format: Article
Language:English
Subjects:
Algorithms
CAD
Communications Engineering
Computer aided design
Computer Communication Networks
Docking
Electrical Engineering
Engineering
Fireworks
IT in Business
Ligands
Networks
Proteins
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The AutoDock is a widely used protein-ligand docking simulation platform which is a simulator to bring the field of computer-aided drug design (CADD) conveniences. The protein-ligand docking problem is of great significance to design more effective and ideal drugs. In order to solve the protein-ligand docking problem more effectively, we propose an improved fireworks algorithm called FWADOCK. FWADOCK utilizes the position updating information of fireworks with the best fitness value to determine the shape of the fireworks and the distribution of sparks. During the process of searching for the optimal solution, it is also considered that the diversity of understanding and how to avoid premature convergence of the algorithm. The proposed algorithm is tested on some benchmark test cases of protein-ligand docking problems and compared with some other related algorithms from different perspectives on the AutoDock platform. The results show that FWADOCK has a competitive performance in solving the protein-ligand docking problem.
ISSN:1383-469X
1572-8153
DOI:10.1007/s11036-019-01412-6