Answers are grounded in this paper and cite their sources.
The Molecular Distance Geometry Problem consists in finding the positions in of the atoms of a molecule, given some of the inter‐atomic distances. We show that under an additional requirement on the given distances this can be transformed to a combinatorial problem. We propose a Branch‐and‐Prune algorithm for the solution of this problem and report on very promising computational results.
No takes yet. Share an insight, caveat, or question.
Liberti et al. (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: