An Adaptive Branching Scheme for the Branch & Prune Algorithm applied to Distance Geometry

Abstract : 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.
Type de document :
Communication dans un congrès
Federated Conference on Computer Science and Information Systems (FedCSIS14), Workshop on Computational Optimization (WCO14), Sep 2014, Warsaw, Poland. IEEE, pp.463-469, 2014, 〈http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6933051&punumber%3D6923033%26sortType%3Dasc_p_Sequence%26filter%3DAND(p_IS_Number%3A6932982)%26pageNumber%3D3〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01093063
Contributeur : Antonio Mucherino <>
Soumis le : mercredi 10 décembre 2014 - 09:52:26
Dernière modification le : mercredi 16 mai 2018 - 11:23:35

Identifiants

  • HAL Id : hal-01093063, version 1

Citation

Douglas Gonçalves, Antonio Mucherino, Carlile Lavor. An Adaptive Branching Scheme for the Branch & Prune Algorithm applied to Distance Geometry. Federated Conference on Computer Science and Information Systems (FedCSIS14), Workshop on Computational Optimization (WCO14), Sep 2014, Warsaw, Poland. IEEE, pp.463-469, 2014, 〈http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6933051&punumber%3D6923033%26sortType%3Dasc_p_Sequence%26filter%3DAND(p_IS_Number%3A6932982)%26pageNumber%3D3〉. 〈hal-01093063〉

Partager

Métriques

Consultations de la notice

365