Abstract
Abstract
Protein–ligand docking can be formulated as a search algorithm associated with an accurate scoring function. However, most current search algorithms cannot show good performance in docking problems, especially for highly flexible docking. To overcome this drawback, this article presents a novel and robust optimization algorithm (EDGA) based on the Lamarckian genetic algorithm (LGA) for solving flexible protein–ligand docking problems. This method applies a population evolution direction-guided model of genetics, in which search direction evolves to the optimum solution. The method is more efficient to find the lowest energy of protein–ligand docking. We consider four search methods—a tradition genetic algorithm, LGA, SODOCK, and EDGA—and compare their performance in docking of six protein–ligand docking problems. The results show that EDGA is the most stable, reliable, and successful.
Get full access to this article
View all access options for this article.
