4 papers
A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem
Michael Souza, Wagner da Rocha, Carlile Lavor
The Combinatorial Discretizable Distance Geometry Problem combines a finite binary lateration process with additional distance constraints. When predecessor sets are not consecutiv…
A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem
Michael Souza, Wagner da Rocha, Carlile Lavor
The Distance Geometry Problem (DGP) asks for a geometric realization of a weighted graph with \(n\) vertices in \(\mathbb{R}^K\) such that Euclidean distances between vertices matc…
A hybrid combinatorial-continuous strategy for solving molecular distance geometry problems
Leonardo D. Secchin, Wagner da Rocha, Mariana da Rosa +2
The Molecular Distance Geometry Problem (MDGP) is essential in structural biology, as it seeks to determine three-dimensional protein structures from partial interatomic distances.…
An Angle-Based Algorithmic Framework for the Interval Discretizable Distance Geometry Problem
Wagner A. A. da Rocha, Carlile Lavor, Leo Liberti +3
Distance Geometry plays a central role in determining protein structures from Nuclear Magnetic Resonance (NMR) data, a task known as the Molecular Distance Geometry Problem (MDGP).…