On the number of solutions of the discretizable molecular distance geometry problem

The Discretizable Molecular Distance Geometry Problem is a subset of instances of the distance geometry problem 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 perform an etensive theoretical analysis of the number of solutions for these instances and we prove that this number is a power of two with probability one.

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino
• Keywords: CORR 2010, Distance Geometry Problem, Education, Molecular Distance Geometry, YES Instances