Sciweavers

CORR
2010
Springer
94views Education» more  CORR 2010»
12 years 10 months ago
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-...
Leo Liberti, Benoît Masson, Jon Lee, Carlile...
SAC
2009
ACM
13 years 10 months ago
On a discretizable subclass of instances of the molecular distance geometry problem
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...
Carlile Lavor, Leo Liberti, Antonio Mucherino, Nel...