Optimal partial discretization orders for discretizable distance geometry
From MaRDI portal
Recommendations
- Optimal Discretization Orders for Distance Geometry: A Theoretical Standpoint
- Discretization vertex orders in 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
Cites work
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- An overview of bilevel optimization
- An overview on protein structure determination by NMR: historical and future perspectives of the use of distance geometry methods
- Discretization orders and efficient computation of Cartesian coordinates for distance geometry
- Discretization orders for distance geometry problems
- Discretization orders for protein side chains
- Distance Geometry
- Distance geometry in structural biology: new perspectives
- Distributed Clock Synchronization for Wireless Sensor Networks Using Belief Propagation
- Euclidean distance geometry and applications
- Fundamental Limits on Synchronizing Clocks Over Networks
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- Hierarchical optimization: An introduction
- Molecular distance geometry methods: from continuous to discrete
- On the Identification of Discretization Orders for Distance Geometry with Intervals
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- Preface
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- Solving a generalized distance geometry problem for protein structure determination
- 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
Cited in
(14)- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- The referenced vertex ordering problem: theory, applications, and solution methods
- 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
- On the optimality of finding DMDGP symmetries
- Optimal Discretization Orders for Distance Geometry: A Theoretical Standpoint
- 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
- Constraint programming approaches for the discretizable molecular distance geometry problem
- On distance graph coloring problems
- An impossible combinatorial counting method in distance geometry
- Discretization orders for distance geometry problems
This page was built for publication: Optimal partial discretization orders for discretizable distance geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827765)
