2000 character limit reached
On the number of solutions of the discretizable molecular distance geometry problem
Published 9 Oct 2010 in cs.DM, cs.CG, and q-bio.QM | (1010.1834v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.