Recent advances on the Discretizable Molecular Distance Geometry Problem

The Molecular Distance Geometry Problem (MDGP) consists in finding an embedding in R3 of a nonnegatively weighted simple undirected graph with the property that the Euclidean distances between embedded adjacent vertices must be the same as the corresponding edge weights. The Discretizable Molecular...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research 2012-06, Vol.219 (3), p.698-706
Main Authors:	Lavor, Carlile, Liberti, Leo, Maculan, Nelson, Mucherino, Antonio
Format:	Article
Language:	English
Subjects:	Algorithmics. Computability. Computer arithmetics Analytical, structural and metabolic biochemistry Applied sciences Bioinformatics Biological and medical sciences Branch-and-prune Computer science control theory systems Euclidean space Exact sciences and technology Flows in networks. Combinatorial problems Fundamental and applied biological sciences. Psychology General aspects, investigation methods Geometry Graph theory Information retrieval. Graph Mathematical problems NMR Nuclear magnetic resonance Operational research and scientific management Operational research. Management science Operations research Protein conformation Proteins Studies Theoretical computing
Citations:	Items that this one cites Items that cite this one
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!