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

Podrobná bibliografia

Vydané v:	2014 Federated Conference on Computer Science and Information Systems Ročník 2; s. 457 - 463
Hlavní autori:	Goncalves, Douglas, Mucherino, Antonio, Lavor, Carlile
Médium:	Konferenčný príspevok.. Journal Article
Jazyk:	English
Vydavateľské údaje:	Polish Information Processing Society 01.09.2014
Predmet:	Atomic layer deposition Computer science Equations Geometry Nuclear magnetic resonance Optimization
ISSN:	2300-5963
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!