Abstract
We previously described BCL::Conf, a knowledge-based conformation sampling algorithm utilizing a small molecule fragment rotamer library derived from the Cambridge Structural Database (CSD, license required), as a component of the BioChemical Library (BCL) cheminformatics toolkit. This paper describes substantial improvements made to the BCL::Conf algorithm and a transition to a rotamer library derived from molecules in the Crystallography Open Database (COD, no license required). We demonstrate the performance of the new BCL::Conf on native conformer recovery in the Platinum dataset of high-quality protein-ligand complexes. This set of 2859 structures has previously been used to assess the performance of over a dozen conformer generation algorithms, including the Conformator, Balloon, RDKit DG, ETKDG, Confab, Frog2, MultiConf-DOCK, CSD conformer generator, ConfGenX-OPSL3 force field, Omega, excalc, iCon, and MOE. These benchmarks suggest that the CSD conformer generator is at the state of the art of reported conformer generators. Our results indicate that the improved BCL::Conf significantly outperforms the CSD conformer generation algorithm at binding conformer recovery across a range of ensemble sizes and with similarly fast rates of conformer generation. BCL::Conf is now distributed with the COD-derived rotamer library and is free for academic use. The BCL can be downloaded at http://meilerlab.org/bclcommons for Windows, Linux, or Apple operating systems. BCL::Conf can now also be accessed via webserver at http://meilerlab.org/bclconf.
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.