Discretization orders for distance geometry problems
From MaRDI portal
Recommendations
- Discretization vertex orders in distance geometry
- Optimal partial discretization orders for discretizable distance geometry
- The discretizable molecular distance geometry problem
- The discretizable distance geometry problem
- An integer programming approach for the search of discretization orders in distance geometry problems
Cites work
- scientific article; zbMATH DE number 1187130 (Why is no real title available?)
- scientific article; zbMATH DE number 1101489 (Why is no real title available?)
- scientific article; zbMATH DE number 835705 (Why is no real title available?)
- scientific article; zbMATH DE number 3080144 (Why is no real title available?)
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- A multivariate partition approach to optimization problems
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- Computational Experience with the Molecular Distance Geometry Problem
- Experimental and Efficient Algorithms
- Extending the geometric build-up algorithm for the molecular distance geometry problem
- Global Continuation for Distance Geometry Problems
- Molecular distance geometry methods: from continuous to discrete
- On the computation of protein backbones by using artificial backbones of hydrogens
- On the definition of artificial backbones for the discretizable molecular distance geometry problem
- On the number of solutions of the discretizable molecular distance geometry problem
- Recent advances on the discretizable molecular distance geometry problem
- Rigid versus unique determination of protein structures with geometric buildup
- Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems
- The discretizable distance geometry problem
- The discretizable molecular distance geometry problem
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- Theory of semidefinite programming for sensor network localization
Cited in
(36)- On a relationship between graph realizability and distance matrix completion
- On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data
- An impossible combinatorial counting method in distance geometry
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- Recent advances on the interval distance geometry problem
- On the polynomiality of finding \(^K\text{DMDGP}\) re-orders
- Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems
- Constraint programming approaches for the discretizable molecular distance geometry problem
- The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry
- The discretizable molecular distance geometry problem
- A least-squares approach for discretizable distance geometry problems with inexact distances
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- Minimal NMR distance information for rigidity of protein graphs
- Molecular distance geometry methods: from continuous to discrete
- An approach to dynamical distance geometry
- Six mathematical gems from the history of distance geometry
- Optimal partial discretization orders for discretizable distance geometry
- A quantum approach to the discretizable molecular distance geometry problem
- Optimal Discretization Orders for Distance Geometry: A Theoretical Standpoint
- Is the distance geometry problem in NP?
- On the optimality of finding DMDGP symmetries
- Discretization orders and efficient computation of Cartesian coordinates for distance geometry
- Discretization vertex orders in distance geometry
- On the Identification of Discretization Orders for Distance Geometry with Intervals
- Discretization orders for protein side chains
- Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis
- Distance geometry on the sphere
- Feasibility check for the distance geometry problem: an application to molecular conformations
- On the recognition of unit disk graphs and the distance geometry problem with ranges
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- Recent advances on the discretizable molecular distance geometry problem
- New error measures and methods for realizing protein graphs from distance data
- The discretizable distance geometry problem
- The referenced vertex ordering problem: theory, applications, and solution methods
- An integer programming approach for the search of discretization orders in distance geometry problems
This page was built for publication: Discretization orders for distance geometry problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691496)
