A parallel version of the Branch & Prune algorithm for the Molecular Distance Geometry Problem
We consider the Molecular Distance Geometry Problem (MDGP), which is the problem of finding the conformation of a molecule from some known distances between its atoms. Such distances can be estimated by performing experiments of Nuclear Magnetic Resonance (NMR). Unfortunately, data obtained during t...
Saved in:
| Published in: | ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 pp. 1 - 6 |
|---|---|
| Main Authors: | , , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
01.05.2010
|
| Subjects: | |
| ISBN: | 9781424477166, 1424477166 |
| ISSN: | 2161-5322 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!