Answers are grounded in this paper and cite their sources.
Distance geometry is a technique widely used to find atomic coordinates that agree with given upper and lower bounds on the interatomic distances. It is successful because it chooses at random some relatively good "trial coordinates" that take into account the whole molecule and all constraints at once. Customarily, these trial coordinates must be refined by minimizing a penalty function until the structure agrees with the original bounds. Here we present an alternative to minimizing the penalty function, which has the advantage of more precisely satisfying the bounds, showing more clearly when the bounds are mutually contradictory, and simultaneously optimizing an objective function subject to precise satisfaction of the bounds.
No takes yet. Share an insight, caveat, or question.
Crippen et al. (1988) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: