Metzler W J, Hare D R, Pardi A
Department of Chemistry and Biochemistry, University of Colorado, Boulder, 80309-0215.
Biochemistry. 1989 Aug 22;28(17):7045-52. doi: 10.1021/bi00443a040.
Calculations with a metric matrix distance geometry algorithm were performed that show that the standard implementation of the algorithm generally samples a very limited region of conformational space. This problem is most severe when only a small amount of distance information is used as input for the algorithm. Control calculations were performed on linear peptides, disulfide-linked peptides, and a double-stranded DNA decamer where only distances defining the covalent structures of the molecules (as well as the hydrogen bonds for the base pairs in the DNA) were included as input. Since the distance geometry algorithm is commonly used to generate structures of biopolymers from distance data obtained from NMR experiments, simulations were performed on the small globular protein basic pancreatic trypsin inhibitor (BPTI) that mimic calculations performed with actual NMR data. The results on BPTI and on the control peptides indicate that the standard implementation of the algorithm has two main problems: first, that it generates extended structures; second, that it has a tendency to consistently produce similar structures instead of sampling all structures consistent with the input distance information. These results also show that use of a simple root-mean-square deviation for evaluating the quality of the structures generated from NMR data may not be generally appropriate. The main sources of these problems are identified, and our results indicate that the problems are not a fundamental property of the distance geometry algorithm but arise from the implementations presently used to generate structures from NMR data. Several possible methods for alleviating these problems are discussed.
