Discretization vertex orders in distance geometry
From MaRDI portal
(Redirected from Publication:499358)
Recommendations
- Optimal partial discretization orders for discretizable distance geometry
- Discretization orders for distance geometry problems
- 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
- Optimal Discretization Orders for Distance Geometry: A Theoretical Standpoint
Cites work
- scientific article; zbMATH DE number 501471 (Why is no real title available?)
- scientific article; zbMATH DE number 2188749 (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
- Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem
- Counting the Number of Solutions of KDMDGP Instances
- Discretization orders for distance geometry problems
- Distance Geometry
- Euclidean distance geometry and applications
- Geometric science of information. First international conference, GSI 2013, Paris, France, August 28--30, 2013. Proceedings
- Molecular distance geometry methods: from continuous to discrete
- Molecular modeling and simulation. An interdisciplinary guide
- On the Identification of Discretization Orders for Distance Geometry with Intervals
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- Recent advances on the discretizable molecular distance geometry problem
- The discretizable distance geometry problem
- The discretizable molecular distance geometry problem
- The discretizable molecular distance geometry problem seems easier on proteins
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
Cited in
(32)- Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem
- 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
- Oriented conformal geometric algebra and the molecular distance geometry problem
- 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
- NMR protein structure calculation and sphere intersections
- A least-squares approach for discretizable distance geometry problems with inexact distances
- Minimal NMR distance information for rigidity of protein graphs
- On distance-preserving elimination orderings in graphs: complexity and algorithms
- A constrained interval approach to the generalized distance geometry problem
- Preface
- Optimal partial discretization orders for discretizable distance geometry
- A quantum approach to the discretizable molecular distance geometry problem
- Unassigned distance geometry and molecular conformation problems
- Optimal Discretization Orders for Distance Geometry: A Theoretical Standpoint
- A new algorithm for the \(^K\mathrm{DMDGP}\) subclass of distance geometry problems with exact distances
- A note on the Cayley-Menger determinant and the molecular distance geometry problem
- On the optimality of finding DMDGP symmetries
- Discretization orders and efficient computation of Cartesian coordinates for distance geometry
- On the Identification of Discretization Orders for Distance Geometry with Intervals
- Discretization orders for distance geometry problems
- Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- Clifford algebra and the discretizable molecular distance geometry problem
- New error measures and methods for realizing protein graphs from distance data
- Tuning interval branch-and-prune for protein structure determination
- 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 vertex orders in distance geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499358)
