Skip to search formSkip to main contentSkip to account menu
  • Publications
  • Influence
Euclidean Distance Geometry and Applications
TLDR
The theory of Euclidean distance geometry and its most important applications are surveyed, with special emphasis on molecular conformation problems.
View PDF on arXiv
The discretizable molecular distance geometry problem
TLDR
It is shown that under a few assumptions usually satisfied in proteins, the MDGP can be formulated as a search in a discrete space and the DMDGP is NP-hard and a solution algorithm called Branch-and-Prune (BP) is proposed.
View on Springer
A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem
TLDR
A Branch-and-Prune algorithm is proposed for the solution of the Molecular Distance Geometry Problem, showing that under an additional requirement on the given distances this can be transformed to a combinatorial problem.
View via Publisher
Decrease of the incidence of human and canine visceral leishmaniasis after dog vaccination with Leishmune in Brazilian endemic areas.
View on PubMed
Distance Geometry: Theory, Methods, and Applications
TLDR
This paper presents an Overview on Protein Structure Determintion by NMR - Historical and Future Perspectives of the Use of Distance Geometry Methods, and some of their applications in Molecular Modeling.
View via Publisher
A Function to Test Methods Applied to Global Minimization of Potential Energy of Molecules
TLDR
It is proved that the number of local minimizers of this function increases exponentially with the size of the problem, which characterizes the principal difficulty in minimizing molecular potential energy functions.
View on Springer
A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule
View via Publisher
A GA-Simplex Hybrid Algorithm for Global Minimization of Molecular Potential Energy Functions
TLDR
Experimental evidence shows that the global minimum of the potential energy of a molecule corresponds to its most stable conformation, which dictates its properties.
View on Springer
Molecular distance geometry methods: from continuous to discrete
TLDR
Some continuous and discrete methods for solving some problems of molecular distance geometry involve a search in a continuous Euclidean space but sometimes the problem structure helps reduce the search to a discrete set of points.
View via Publisher
Discretization orders for distance geometry problems
TLDR
This work formalizes the decision problem of determining whether such an order exists for a given graph and shows that this problem is NP-complete in general and polynomial for fixed dimension K.
View on Springer
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License