z-logo
Premium
Conformational analysis by intersection: CONAN
Author(s) -
Smellie Andrew,
Stanton Robert,
Henne Randy,
Teig Steve
Publication year - 2002
Publication title -
journal of computational chemistry
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.907
H-Index - 188
eISSN - 1096-987X
pISSN - 0192-8651
DOI - 10.1002/jcc.10175
Subject(s) - intersection (aeronautics) , conical intersection , conformational isomerism , heuristics , cover (algebra) , molecule , path (computing) , space (punctuation) , chemical space , computer science , chemistry , algorithm , drug discovery , mechanical engineering , biochemistry , organic chemistry , engineering , programming language , aerospace engineering , operating system
As high throughput techniques in chemical synthesis and screening improve, more demands are placed on computer assisted design and virtual screening. Many of these computational methods require one or more three‐dimensional conformations for molecules, creating a demand for a conformational analysis tool that can rapidly and robustly cover the low‐energy conformational spaces of small molecules. A new algorithm of intersection is presented here, which quickly generates (on average <0.5 seconds/stereoisomer) a complete description of the low energy conformational space of a small molecule. The molecule is first decomposed into nonoverlapping nodes N (usually rings) and overlapping paths P with conformations (N and P) generated in an offline process. In a second step the node and path data are combined to form distinct conformers of the molecule. Finally, heuristics are applied after intersection to generate a small representative collection of conformations that span the conformational space. In a study of ∼97,000 randomly selected molecules from the MDDR, results are presented that explore these conformations and their ability to cover low‐energy conformational space. © 2002 Wiley Periodicals, Inc. J Comput Chem 24: 10–20, 2003

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here