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...
Uložené v:
| Vydané v: | ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 s. 1 - 6 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
01.05.2010
|
| Predmet: | |
| ISBN: | 9781424477166, 1424477166 |
| ISSN: | 2161-5322 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Buďte prvý, kto okomentuje tento záznam!