Sphere intersection algorithms for Molecular Distance Geometry Problem

Abstract

The problem of estimating the full three-dimensional structure of a molecule, determining the position in space of all the atoms that compose it, is called Molecular Distance Geometry Problem (MDGP). To do this from an incomplete set of distances is NP-hard computational problem, where to get a feasible solution in a reasonable execution time presenting… (More)
DOI: 10.1109/CLEI.2013.6670661

2 Figures and Tables

Topics

  • Presentations referencing similar topics