On the number of solutions of the discretizable molecular distance geometry problem
Discrete Mathematics
2010-10-12 v1 Computational Geometry
Quantitative Methods
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.
Keywords
Cite
@article{arxiv.1010.1834,
title = {On the number of solutions of the discretizable molecular distance geometry problem},
author = {Leo Liberti and Benoit Masson and Jon Lee and Carlile Lavor and Antonio Mucherino},
journal= {arXiv preprint arXiv:1010.1834},
year = {2010}
}
Comments
14 pages, 5 figures