Distance Geometry on the Sphere
From MaRDI portal
Publication:2958102
DOI10.1007/978-3-319-48532-4_18zbMath1482.51009OpenAlexW2551259600WikidataQ62562130 ScholiaQ62562130MaRDI QIDQ2958102
Grzegorz Świrszcz, Leo Liberti, Carlile C. Lavor
Publication date: 1 February 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-48532-4_18
Related Items
Cites Work
- Unnamed Item
- Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
- Discretization orders for distance geometry problems
- The discretizable molecular distance geometry problem
- Double variable neighbourhood search with smoothing for the molecular distance geometry problem
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- The discretizable distance geometry problem
- Recent advances on the discretizable molecular distance geometry problem
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins
- Distance Geometry
- Molecular distance geometry methods: from continuous to discrete
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Global Continuation for Distance Geometry Problems
- Euclidean Distance Geometry and Applications
- Counting the Number of Solutions of KDMDGP Instances
- MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems