A symmetry-based splitting strategy for discretizable distance geometry problems
From MaRDI portal
Publication:1668793
DOI10.1007/s10898-018-0610-9zbMath1405.90134OpenAlexW2791483268WikidataQ62562096 ScholiaQ62562096MaRDI QIDQ1668793
Antonio Mucherino, Douglas S. Gonçalves, Leo Liberti, Felipe Fidalgo, Carlile C. Lavor
Publication date: 29 August 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0610-9
Related Items
Oriented conformal geometric algebra and the molecular distance geometry problem, Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures, On the optimality of finding DMDGP symmetries, Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension, A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances, On the polynomiality of finding \(^K\text{DMDGP}\) re-orders
Cites Work
- Unnamed Item
- The discretizable molecular distance geometry problem
- The discretizable distance geometry problem
- Recent advances on the discretizable molecular distance geometry problem
- Distance geometry optimization for protein structures
- 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
- Solving the Discretizable Molecular Distance Geometry Problem by Multiple Realization Trees
- Distance Geometry in Structural Biology: New Perspectives
- Distributed Algorithms for Message-Passing Systems
- Molecular distance geometry methods: from continuous to discrete
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Euclidean Distance Geometry and Applications
