Fast 3D shape screening of large chemical databases through alignment-recycling

<p>Abstract</p> <p>Background</p> <p>Large chemical databases require fast, efficient, and simple ways of looking for similar structures. Although such tasks are now fairly well resolved for graph-based similarity queries, they remain an issue for 3D approaches, particu...

Full description

Bibliographic Details
Main Authors: Bryant Stephen H, Borodina Yulia, Bolton Evan, Fontaine Fabien
Format: Article
Language:English
Published: BMC 2007-06-01
Series:Chemistry Central Journal
Online Access:http://journal.chemistrycentral.com/content/1/1/12
Description
Summary:<p>Abstract</p> <p>Background</p> <p>Large chemical databases require fast, efficient, and simple ways of looking for similar structures. Although such tasks are now fairly well resolved for graph-based similarity queries, they remain an issue for 3D approaches, particularly for those based on 3D shape overlays. Inspired by a recent technique developed to compare molecular shapes, we designed a hybrid methodology, alignment-recycling, that enables efficient retrieval and alignment of structures with similar 3D shapes.</p> <p>Results</p> <p>Using a dataset of more than one million PubChem compounds of limited size (< 28 heavy atoms) and flexibility (< 6 rotatable bonds), we obtained a set of a few thousand diverse structures covering entirely the 3D shape space of the conformers of the dataset. Transformation matrices gathered from the overlays between these diverse structures and the 3D conformer dataset allowed us to drastically (100-fold) reduce the CPU time required for shape overlay. The alignment-recycling heuristic produces results consistent with <it>de novo </it>alignment calculation, with better than 80% hit list overlap on average.</p> <p>Conclusion</p> <p>Overlay-based 3D methods are computationally demanding when searching large databases. Alignment-recycling reduces the CPU time to perform shape similarity searches by breaking the alignment problem into three steps: selection of diverse shapes to describe the database shape-space; overlay of the database conformers to the diverse shapes; and non-optimized overlay of query and database conformers using common reference shapes. The precomputation, required by the first two steps, is a significant cost of the method; however, once performed, querying is two orders of magnitude faster. Extensions and variations of this methodology, for example, to handle more flexible and larger small-molecules are discussed.</p>
ISSN:1752-153X