Conformational sampling by a general linearized embedding algorithm

Abstract

Listen

Translate article

AbstractLinearized embedding is a variant on the usual distance geometry methods for finding atomic Cartesian coordinates given constraints on interatomic distances. Instead of dealing primarily with the matrix of interatomic distances, linearized embedding concentrates on properties of the metric matrix, the matrix of inner products between pairs of vectors defining local coordinate systems within the molecule. We developed a pair of general computer programs that first convert a given arbitrary conformation of any covalent molecule from atomic Cartesian coordinates representation to internal local coordinate systems enforcing rigid valence geometry and then generate a random sampling of conformers in terms of atomic Cartesian coordinates that satisfy the rigid local geometry and a given list of interatomic distance constraints. We studied the sampling properties of this linearized embedding algorithm vs. a standard metric matrix embedding program, DGEOM, on cyclohexane, cycloheptane, and a cyclic pentapeptide. Linearized embedding always produces exactly correct bond lengths, bond angles, planarities, and chiralities; it runs at least two times faster per structure generated, and is successful as much as four times as often at refining these structures to full agreement with the constraints. It samples the full range of allowed conformations broadly, although not perfectly uniformly. Because local geometry is rigid, linearized embedding's sampling in terms of torsion angles is more restricted than that of DGEOM, but it finds in some instances conformations missed by DGEOM. © 1992 by John Wiley & Sons, Inc.