A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem

The Molecular Distance Geometry Problem consists in finding the positions in of the atoms of a molecule, given some of the inter‐atomic distances. We show that under an additional requirement on the given distances this can be transformed to a combinatorial problem. We propose a Branch‐and‐Prune alg...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International transactions in operational research Ročník 15; číslo 1; s. 1 - 17
Hlavní autoři: Liberti, Leo, Lavor, Carlile, Maculan, Nelson
Médium: Journal Article
Jazyk:angličtina
Vydáno: Oxford, UK Blackwell Publishing Ltd 01.01.2008
Témata:
Algorithms
Branch-and-Prune algorithm
Geometry
Molecular Distance Geometry Problem
Molecular structure
Operations research
Studies
ISSN:0969-6016, 1475-3995
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The Molecular Distance Geometry Problem consists in finding the positions in of the atoms of a molecule, given some of the inter‐atomic distances. We show that under an additional requirement on the given distances this can be transformed to a combinatorial problem. We propose a Branch‐and‐Prune algorithm for the solution of this problem and report on very promising computational results.
Bibliografie:istex:3F8AF5221F5D935BEDA299F262501392A48EDA50
ArticleID:ITOR622
ark:/67375/WNG-98HFM0DF-R
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0969-6016
1475-3995
DOI:10.1111/j.1475-3995.2007.00622.x