A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances
From MaRDI portal
Publication:2041974
DOI10.1007/s00453-021-00835-6OpenAlexW3165164608MaRDI QIDQ2041974
Douglas S. Gonçalves, Michael Souza, Leo Liberti, Carlile C. Lavor
Publication date: 26 July 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.05404
Related Items
Cites Work
- Unnamed Item
- Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
- Discretization vertex orders in distance geometry
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- The discretizable molecular distance geometry problem
- Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- A symmetry-based splitting strategy for discretizable distance geometry problems
- Realizing Euclidean distance matrices by sphere intersection
- Minimal NMR distance information for rigidity of protein graphs
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- The discretizable distance geometry problem
- Recent advances on the discretizable molecular distance geometry problem
- Distance geometry optimization for protein structures
- On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data
- A note on the Cayley-Menger determinant and the molecular distance geometry problem
- Distance geometry and data science
- On the optimality of finding DMDGP symmetries
- Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension
- On the polynomiality of finding \(^K\text{DMDGP}\) re-orders
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem
- The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins
- Solving the Discretizable Molecular Distance Geometry Problem by Multiple Realization Trees
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN
- On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem
- Euclidean Distance Geometry
- Euclidean Distance Geometry and Applications
- Counting the Number of Solutions of KDMDGP Instances
- On the Identification of Discretization Orders for Distance Geometry with Intervals
