Abstract
The protein–ligand docking problem plays a crucial role in the drug discovery process and remains challenging in bioinformatics. A successful protein–ligand docking approach depends on two key factors: an efficient search strategy and an effective scoring function. In this study, we attempt to use an adaptive differential evolution (DE) algorithm as the search strategy. The search ability of the proposed DE algorithm is improved by incorporating a parameter adaptation scheme and a modified mutation strategy. In addition, the scoring function of the classical AutoDock Vina suite is employed as the fitness function of the proposed approach. Finally, the performance of the adaptive DE method in solving the protein–ligand docking problem is evaluated on 40 test docking instances. The experimental results and statistical analysis demonstrate the effectiveness of the proposed adaptive DE algorithm compared with five other classical evolutionary algorithms. The results of this study reveal that employing powerful evolutionary algorithms, such as adaptive DE, contributes to solving the protein–ligand docking problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.