An adaptive branching scheme for the Branch & Prune algorithm applied to Distance Geometry

The Molecular Distance Geometry Problem (MDGP) is the one of finding molecular conformations that satisfy a set of distance constraints obtained through experimental techniques such as Nuclear Magnetic Resonance (NMR). We consider a subclass of MDGP instances that can be discretized, where the searc...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2014 Federated Conference on Computer Science and Information Systems Ročník 2; s. 457 - 463
Hlavní autoři: Goncalves, Douglas, Mucherino, Antonio, Lavor, Carlile
Médium: Konferenční příspěvek Journal Article
Jazyk:angličtina
Vydáno: Polish Information Processing Society 01.09.2014
Témata:
Atomic layer deposition
Computer science
Equations
Geometry
Nuclear magnetic resonance
Optimization
ISSN:2300-5963
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The Molecular Distance Geometry Problem (MDGP) is the one of finding molecular conformations that satisfy a set of distance constraints obtained through experimental techniques such as Nuclear Magnetic Resonance (NMR). We consider a subclass of MDGP instances that can be discretized, where the search domain has the structure of a tree, which can be explored by using an interval Branch & Prune (iBP) algorithm. When all available distances are exact, all candidate positions for a given molecular conformation can be enumerated. This is however not possible in presence of interval distances, because a continuous subset of positions can actually be computed for some atoms. The focus of this work is on a new scheme for an adaptive generation of a discrete subset of candidate positions from this continuous subset. Our generated candidate positions do not only satisfy the distances employed in the discretization process, but also additional distances that might be available (the so-called pruning distances). Therefore, this new scheme is able to guide more efficiently the search in the feasible regions of the search domain. In this work, we motivate the development and formally introduce this new adaptive scheme. Presented computational experiments show that iBP, integrated with our new scheme, outperforms the standard iBP on a set of NMR-like instances.
ISSN:2300-5963
DOI:10.15439/2014F92