MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems
From MaRDI portal
Publication:5747881
DOI10.1007/978-3-642-15582-6_34zbMath1294.68144OpenAlexW1864754159WikidataQ62562193 ScholiaQ62562193MaRDI QIDQ5747881
Leo Liberti, Antonio Mucherino, Carlile C. Lavor
Publication date: 14 September 2010
Published in: Mathematical Software – ICMS 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15582-6_34
Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distance geometry (51K99) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items
The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances, A least-squares approach for discretizable distance geometry problems with inexact distances, An integer programming approach for the search of discretization orders in distance geometry problems, The discretizable distance geometry problem, Recent advances on the discretizable molecular distance geometry problem, On a Relationship Between Graph Realizability and Distance Matrix Completion, Distance Geometry on the Sphere, A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems, A study on the covalent geometry of proteins and its impact on distance geometry, On the number of realizations of certain Henneberg graphs arising in protein conformation, Preface: Special issue dedicated to distance geometry, The discretizable molecular distance geometry problem, On the computation of protein backbones by using artificial backbones of hydrogens
Uses Software
