Ewing T J, Makino S, Skillman A G, Kuntz I D
Department of Pharmaceutical Chemistry, School of Pharmacy, University of California, San Francisco 94143-0446, USA.
J Comput Aided Mol Des. 2001 May;15(5):411-28. doi: 10.1023/a:1011115820450.
In this paper we describe the search strategies developed for docking flexible molecules to macomolecular sites that are incorporated into the widely distributed DOCK software, version 4.0. The search strategies include incremental construction and random conformation search and utilize the existing Coulombic and Lennard-Jones grid-based scoring function. The incremental construction strategy is tested with a panel of 15 crystallographic testcases, created from 12 unique complexes whose ligands vary in size and flexibility. For all testcases, at least one docked position is generated within 2 A of the crystallographic position. For 7 of 15 testcases, the top scoring position is also within 2 A of the crystallographic position. The algorithm is fast enough to successfully dock a few testcases within seconds and most within 100 s. The incremental construction and the random search strategy are evaluated as database docking techniques with a database of 51 molecules docked to two of the crystallographic testcases. Incremental construction outperforms random search and is fast enough to reliably rank the database of compounds within 15 s per molecule on an SGI R10000 cpu.
在本文中,我们描述了为将柔性分子对接至大分子位点而开发的搜索策略,这些策略已被纳入广泛使用的DOCK软件4.0版本中。搜索策略包括增量构建和随机构象搜索,并利用现有的基于库仑和伦纳德-琼斯网格的评分函数。增量构建策略通过一组15个晶体学测试用例进行了测试,这些测试用例来自12个独特的复合物,其配体在大小和柔性方面各不相同。对于所有测试用例,在晶体学位置的2埃范围内至少生成一个对接位置。对于15个测试用例中的7个,得分最高的位置也在晶体学位置的2埃范围内。该算法速度足够快,可以在几秒钟内成功对接一些测试用例,大多数在100秒内完成。增量构建和随机搜索策略作为数据库对接技术,用一个包含51个分子的数据库对接至两个晶体学测试用例进行了评估。增量构建优于随机搜索,并且速度足够快,能够在SGI R10000 CPU上以每个分子15秒的速度可靠地对化合物数据库进行排名。