Discretization orders for distance geometry problems
From MaRDI portal
Publication:691496
DOI10.1007/s11590-011-0302-6zbMath1258.90096OpenAlexW2034762747WikidataQ62562159 ScholiaQ62562159MaRDI QIDQ691496
Jon Lee, Audrey Lee-St. John, Leo Liberti, Carlile C. Lavor
Publication date: 30 November 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0302-6
Related Items
The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances, The referenced vertex ordering problem: theory, applications, and solution methods, Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems, 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 \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry, The discretizable distance geometry problem, Recent advances on the discretizable molecular distance geometry problem, Recent advances on the interval distance geometry problem, Constraint programming approaches for the discretizable molecular distance geometry problem, On a Relationship Between Graph Realizability and Distance Matrix Completion, Distance Geometry on the Sphere, On the number of realizations of certain Henneberg graphs arising in protein conformation, Minimal NMR distance information for rigidity of protein graphs, Discretization orders and efficient computation of Cartesian coordinates for distance geometry, Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures, Discretization orders for protein side chains, Optimal Discretization Orders for Distance Geometry: A Theoretical Standpoint, Discretization vertex orders in distance geometry, Assigned and unassigned distance geometry: applications to biological molecules and nanostructures, On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data, On the optimality of finding DMDGP symmetries, New error measures and methods for realizing protein graphs from distance data, The discretizable molecular distance geometry problem, Six mathematical gems from the history of distance geometry, Optimal partial discretization orders for discretizable distance geometry, On the polynomiality of finding \(^K\text{DMDGP}\) re-orders, Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis, A quantum approach to the discretizable molecular distance geometry problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the computation of protein backbones by using artificial backbones of hydrogens
- The discretizable molecular distance geometry problem
- Theory of semidefinite programming for sensor network localization
- Rigid versus unique determination of protein structures with geometric buildup
- Extending the geometric build-up algorithm for the molecular distance geometry problem
- A multivariate partition approach to optimization problems
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems
- The discretizable distance geometry problem
- Recent advances on the discretizable molecular distance geometry problem
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- 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
- On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem
- Computational Experience with the Molecular Distance Geometry Problem
- Experimental and Efficient Algorithms
