Journal of Global Optimization
Molecular Modeling and Simulation: An Interdisciplinary Guide
Molecular Modeling and Simulation: An Interdisciplinary Guide
Journal of Global Optimization
SIAM Journal on Scientific Computing
Extending the geometric build-up algorithm for the molecular distance geometry problem
Information Processing Letters
The discretizable molecular distance geometry problem
Computational Optimization and Applications
Hi-index | 0.00 |
Some information about protein structure can be obtained by using Nuclear Magnetic Resonance NMR techniques, but they provide only a sparse set of distances between atoms in a protein. The Molecular Distance Geometry Problem MDGP consists in determining the three-dimensional structure of a molecule using a set of known distances between some atoms. Recently, a Branch and Prune BP algorithm was proposed to calculate the backbone of a protein, based on a discrete formulation for the MDGP. We present an extension of the BP algorithm that can calculate not only the protein backbone, but the whole three-dimensional structure of proteins.