Solving the Discretizable Molecular Distance Geometry Problem by Multiple Realization Trees

Pedro Nucci (), Loana Tito Nogueira () and Carlile Lavor ()
Additional contact information
Pedro Nucci: Brazilian Navy, Navy Arsenal of Rio de Janeiro
Loana Tito Nogueira: Universidade Federal Fluminense, Instituto de Computação
Carlile Lavor: Campinas-SP, IMECC-UNICAMP

Chapter Chapter 9 in Distance Geometry, 2013, pp 161-176 from Springer

Abstract: Abstract The discretizable molecular distance geometry problem (DMDGP) is a subclass of the MDGP, where instances can be solved using a discrete algorithm called branch-and-prune (BP). We present an initial study showing that the BP algorithm can be used differently from its original form, where the initial atoms are fixed and the branches of the BP tree are generated 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.

Keywords: Distance geometry; Branch-and-prune; Realization tree (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-5128-0_9

Ordering information: This item can be ordered from
http://www.springer.com/9781461451280

DOI: 10.1007/978-1-4614-5128-0_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().