Pages that link to "Item:Q1926615"
From MaRDI portal
The following pages link to The discretizable distance geometry problem (Q1926615):
Displaying 37 items.
- Discretization orders and efficient computation of Cartesian coordinates for distance geometry (Q476278) (← links)
- Discretization vertex orders in distance geometry (Q499358) (← links)
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures (Q503659) (← links)
- Discretization orders for distance geometry problems (Q691496) (← links)
- Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis (Q778422) (← links)
- Clifford algebra and the discretizable molecular distance geometry problem (Q888986) (← links)
- A symmetry-based splitting strategy for discretizable distance geometry problems (Q1668793) (← links)
- Recent advances on the interval distance geometry problem (Q1683318) (← links)
- Realizing Euclidean distance matrices by sphere intersection (Q1728090) (← links)
- Minimal NMR distance information for rigidity of protein graphs (Q1728101) (← links)
- Oriented conformal geometric algebra and the molecular distance geometry problem (Q1728194) (← links)
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures (Q1730533) (← links)
- Recent advances on the discretizable molecular distance geometry problem (Q1926689) (← links)
- A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances (Q2041974) (← links)
- A quantum approach to the discretizable molecular distance geometry problem (Q2101499) (← links)
- The referenced vertex ordering problem: theory, applications, and solution methods (Q2165588) (← links)
- A least-squares approach for discretizable distance geometry problems with inexact distances (Q2174885) (← links)
- The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry (Q2174889) (← links)
- A constrained interval approach to the generalized distance geometry problem (Q2174890) (← links)
- Distance geometry and data science (Q2192022) (← links)
- On the optimality of finding DMDGP symmetries (Q2244000) (← links)
- Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension (Q2274754) (← links)
- On the polynomiality of finding \(^K\text{DMDGP}\) re-orders (Q2322885) (← links)
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances (Q2392117) (← links)
- On the number of realizations of certain Henneberg graphs arising in protein conformation (Q2448906) (← links)
- Optimal partial discretization orders for discretizable distance geometry (Q2827765) (← links)
- Distance Geometry on the Sphere (Q2958102) (← links)
- Optimal Discretization Orders for Distance Geometry: A Theoretical Standpoint (Q3304780) (← links)
- On a Relationship Between Graph Realizability and Distance Matrix Completion (Q4596149) (← links)
- On the Exact Solution of the Distance Geometry with Interval Distances in Dimension 1 (Q4609775) (← links)
- Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems (Q5084653) (← links)
- Coordinate Difference Matrices (Q5222098) (← links)
- Constraint programming approaches for the discretizable molecular distance geometry problem (Q6065908) (← links)
- On distance graph coloring problems (Q6070499) (← links)
- Cycle-based formulations in distance geometry (Q6114894) (← links)
- A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems (Q6155061) (← links)
- An impossible combinatorial counting method in distance geometry (Q6558675) (← links)
