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...

Full description

Bibliographic Details

Published in:	2014 Federated Conference on Computer Science and Information Systems Vol. 2; pp. 457 - 463
Main Authors:	Goncalves, Douglas, Mucherino, Antonio, Lavor, Carlile
Format:	Conference Proceeding Journal Article
Language:	English
Published:	Polish Information Processing Society 01.09.2014
Subjects:	Atomic layer deposition Computer science Equations Geometry Nuclear magnetic resonance Optimization
ISSN:	2300-5963
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!