On the number of solutions of the discretizable molecular distance geometry problem
classification
💻 cs.DM
cs.CGq-bio.QM
keywords
distancegeometrydiscretizablemolecularnumberproblemsolutionsalgorithm
read the original abstract
The Generalized Discretizable Molecular Distance Geometry Problem is a distance geometry problems that can be solved by a combinatorial algorithm called ``Branch-and-Prune''. It was observed empirically that the number of solutions of YES instances is always a power of two. We give a proof that this event happens with probability one.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.