Discretization orders and efficient computation of Cartesian coordinates for distance geometry
From MaRDI portal
Publication:476278
DOI10.1007/s11590-014-0724-zzbMath1302.90177OpenAlexW2063246173MaRDI QIDQ476278
Douglas S. Gonçalves, Antonio Mucherino
Publication date: 28 November 2014
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-014-0724-z
combinatorial optimizationdistance geometrycoordinate computationdiscretization ordersmolecular conformations
Related Items
A least-squares approach for discretizable distance geometry problems with inexact distances ⋮ A constrained interval approach to the generalized distance geometry problem ⋮ Recent advances on the interval distance geometry problem ⋮ Clifford algebra and the discretizable molecular distance geometry problem ⋮ A study on the covalent geometry of proteins and its impact on distance geometry ⋮ A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN ⋮ Minimal NMR distance information for rigidity of protein graphs ⋮ 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 ⋮ Optimal Discretization Orders for Distance Geometry: A Theoretical Standpoint ⋮ NMR protein structure calculation and sphere intersections ⋮ Assigned and unassigned distance geometry: applications to biological molecules and nanostructures ⋮ Optimal partial discretization orders for discretizable distance geometry ⋮ On the polynomiality of finding \(^K\text{DMDGP}\) re-orders
Cites Work
- Unnamed Item
- Unnamed Item
- Discretization vertex orders in distance geometry
- Discretization orders for distance geometry problems
- The discretizable molecular distance geometry problem
- Solving molecular distance geometry problems by global optimization algorithms
- The discretizable 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
- Distance Geometry in Structural Biology: New Perspectives
- Distance Geometry
- Euclidean Distance Geometry and Applications
- On the Identification of Discretization Orders for Distance Geometry with Intervals