{"title":"基于可持续进化算法的高效蛋白质配体对接","authors":"Emrah Atilgan, Jianjun Hu","doi":"10.1145/1830483.1830521","DOIUrl":null,"url":null,"abstract":"AutoDock is a widely used automated protein docking program in structure-based drug-design. Different search algorithms such as simulated annealing, traditional genetic algorithm (GA) and Lamarckian genetic algorithm (LGA) are implemented in AutoDock. However, the docking performance of these algorithms is still limited by the local optima issue of simulated annealing or the premature convergence issue typical in traditional evolutionary algorithms (EA). Due to the stochastic nature of these search algorithms, users usually need to run multiple times to get reasonable docking results, which is time-consuming. We have developed a new docking program AutoDockX by applying a sustainable GA, Age-Layered Population Structure (ALPS) to the protein docking problem. We tested the docking performance over three different proteins (pr, cox and hsp90) with more than 20 candidate ligands for each protein. Our experiments showed that the sustainable GA based AutodockX achieved significantly better docking performance in terms of running time and robustness than all the existing search algorithms implemented in the latest version of AutoDock. AutodockX thus has unique advantages in large-scale virtual screening.","PeriodicalId":174618,"journal":{"name":"2010 10th International Conference on Hybrid Intelligent Systems","volume":"361 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Efficient protein-ligand docking using sustainable evolutionary algorithms\",\"authors\":\"Emrah Atilgan, Jianjun Hu\",\"doi\":\"10.1145/1830483.1830521\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"AutoDock is a widely used automated protein docking program in structure-based drug-design. Different search algorithms such as simulated annealing, traditional genetic algorithm (GA) and Lamarckian genetic algorithm (LGA) are implemented in AutoDock. However, the docking performance of these algorithms is still limited by the local optima issue of simulated annealing or the premature convergence issue typical in traditional evolutionary algorithms (EA). Due to the stochastic nature of these search algorithms, users usually need to run multiple times to get reasonable docking results, which is time-consuming. We have developed a new docking program AutoDockX by applying a sustainable GA, Age-Layered Population Structure (ALPS) to the protein docking problem. We tested the docking performance over three different proteins (pr, cox and hsp90) with more than 20 candidate ligands for each protein. Our experiments showed that the sustainable GA based AutodockX achieved significantly better docking performance in terms of running time and robustness than all the existing search algorithms implemented in the latest version of AutoDock. AutodockX thus has unique advantages in large-scale virtual screening.\",\"PeriodicalId\":174618,\"journal\":{\"name\":\"2010 10th International Conference on Hybrid Intelligent Systems\",\"volume\":\"361 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 10th International Conference on Hybrid Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1830483.1830521\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 10th International Conference on Hybrid Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1830483.1830521","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13
摘要
AutoDock是一种广泛应用于基于结构的药物设计的自动蛋白质对接程序。在AutoDock中实现了模拟退火、传统遗传算法(GA)和拉马克遗传算法(LGA)等不同的搜索算法。然而,这些算法的对接性能仍然受到模拟退火的局部最优问题或传统进化算法(EA)中典型的过早收敛问题的限制。由于这些搜索算法的随机性,用户通常需要多次运行才能得到合理的对接结果,这是非常耗时的。我们将一种可持续遗传算法——年龄层种群结构(Age-Layered Population Structure, ALPS)应用于蛋白质对接问题,开发了一种新的对接程序AutoDockX。我们测试了三种不同蛋白(pr, cox和hsp90)的对接性能,每种蛋白有20多个候选配体。实验表明,基于可持续遗传算法的AutodockX在运行时间和鲁棒性方面的对接性能明显优于最新版本AutoDock中实现的所有现有搜索算法。因此,AutodockX在大规模虚拟筛选方面具有独特的优势。
Efficient protein-ligand docking using sustainable evolutionary algorithms
AutoDock is a widely used automated protein docking program in structure-based drug-design. Different search algorithms such as simulated annealing, traditional genetic algorithm (GA) and Lamarckian genetic algorithm (LGA) are implemented in AutoDock. However, the docking performance of these algorithms is still limited by the local optima issue of simulated annealing or the premature convergence issue typical in traditional evolutionary algorithms (EA). Due to the stochastic nature of these search algorithms, users usually need to run multiple times to get reasonable docking results, which is time-consuming. We have developed a new docking program AutoDockX by applying a sustainable GA, Age-Layered Population Structure (ALPS) to the protein docking problem. We tested the docking performance over three different proteins (pr, cox and hsp90) with more than 20 candidate ligands for each protein. Our experiments showed that the sustainable GA based AutodockX achieved significantly better docking performance in terms of running time and robustness than all the existing search algorithms implemented in the latest version of AutoDock. AutodockX thus has unique advantages in large-scale virtual screening.