Thursday, 13:45 - 14:10 h, Room: H 3005


Pedro Nucci
Solving the discretizable molecular distance geometry problem by multiple realization trees

Coauthors: Carlile Lavor, Loana T. Nogueira


The Discretizable Molecular Distance Geometry Problem (DMDGP) is a subclass of the MDGP, which can be solved using a discrete method called Branch-and-Prune (BP) algorithm. We present an initial study showing that the BP algorithm may be used differently from its original form, which fixes the initial atoms of a molecule and then branches the BP tree until the last atom is reached. Particularly, we show that the use of multiple BP trees may explore the search space faster than the original BP.


Talk 2 of the invited session Thu.2.H 3005
"Distance geometry and applications" [...]
Cluster 2
"Combinatorial optimization" [...]


  The system of instant Virginia Payday Loans allows any adult U.S. citizen. If you have already decided to take Levitra, be sure to consult a doctor, you don't have any contraindications and act strictly due to a prescription.