Systematic exploration of protein conformational space using a distance geometry approach
The optimization approaches classically used during the determination of protein structure
encounter various difficulties, especially when the size of the conformational space is large …
encounter various difficulties, especially when the size of the conformational space is large …
Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
In the 2 years since our last 4OR review of distance geometry methods with applications to
proteins and nanostructures, there has been rapid progress in treating uncertainties in the …
proteins and nanostructures, there has been rapid progress in treating uncertainties in the …
Oriented conformal geometric algebra and the molecular distance geometry problem
The problem of 3D protein structure determination using distance information from nuclear
magnetic resonance (NMR) experiments is a classical problem in distance geometry. NMR …
magnetic resonance (NMR) experiments is a classical problem in distance geometry. NMR …
[图书][B] Comparison of symmetry breaking and input ordering techniques for routing problems
In this paper, we consider routing problems with identical vehicles. In their standard
formulations, decision variables (such as the routing decisions and delivery quantities) often …
formulations, decision variables (such as the routing decisions and delivery quantities) often …
On the polynomiality of finding KDMDGP re-orders
On the polynomiality of finding KDMDGP re-orders - ScienceDirect Skip to main contentSkip to
article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …
article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …
A New Algorithm for the DMDGP Subclass of Distance Geometry Problems with Exact Distances
The fundamental inverse problem in distance geometry is the one of finding positions from
inter-point distances. The Discretizable Molecular Distance Geometry Problem (DMDGP) is …
inter-point distances. The Discretizable Molecular Distance Geometry Problem (DMDGP) is …
Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension
VS Camargo, EV Castelani, LAF Fernandes… - Advances in Applied …, 2019 - Springer
Abstract The K-Discretizable Molecular Distance Geometry Problem (^ K DMDGP K
DMDGP) is a subclass of the Distance Geometry Problem (DGP), whose complexity is NP …
DMDGP) is a subclass of the Distance Geometry Problem (DGP), whose complexity is NP …
An autonomic parallel strategy for exhaustive search tree algorithms on shared or heterogeneous systems
FGO Passos, VEF Rebello - Concurrency and Computation …, 2024 - Wiley Online Library
Backtracking branch‐and‐prune (BP) algorithms and their variants are exhaustive search
tree techniques widely employed to solve optimization problems in many scientific areas …
tree techniques widely employed to solve optimization problems in many scientific areas …
On the optimality of finding DMDGP symmetries
Abstract The Discretizable Molecular Distance Geometry Problem (DMDGP) is a subclass of
the Distance Geometry Problem, which aims to embed a weighted simple undirected graph …
the Distance Geometry Problem, which aims to embed a weighted simple undirected graph …
On the discretization of distance geometry: Theory, algorithms and applications
A Mucherino - 2018 - inria.hal.science
Over the last years, my research activity has mainly been focused on Distance Geometry
(DG). Differently from the classical Euclidean Geometry, DG solely relies on distances, and …
(DG). Differently from the classical Euclidean Geometry, DG solely relies on distances, and …