@inproceedings{6efd24fafe824832b874b08fa129fedc,
title = "On the number of solutions of the discretizable molecular distance geometry problem",
abstract = "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 extensive theoretical analysis of the number of solutions for these instances and we prove that this number is a power of two with probability one.",
keywords = "Branch-and-Prune, distance geometry, power of two, symmetry",
author = "Leo Liberti and Beno{\^i}t Masson and Jon Lee and Carlile Lavor and Antonio Mucherino",
year = "2011",
month = jan,
day = "1",
doi = "10.1007/978-3-642-22616-8\_26",
language = "English",
isbn = "9783642226151",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "322--342",
booktitle = "Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Proceedings",
}