Pages that link to "Item:Q499358"

The following pages link to Discretization vertex orders in distance geometry (Q499358):

Displaying 26 items.

• Discretization orders and efficient computation of Cartesian coordinates for distance geometry (Q476278) (← links)
• Assigned and unassigned distance geometry: applications to biological molecules and nanostructures (Q503659) (← links)
• New error measures and methods for realizing protein graphs from distance data (Q517453) (← links)
• Clifford algebra and the discretizable molecular distance geometry problem (Q888986) (← links)
• Recent advances on the interval distance geometry problem (Q1683318) (← links)
• Minimal NMR distance information for rigidity of protein graphs (Q1728101) (← links)
• Oriented conformal geometric algebra and the molecular distance geometry problem (Q1728194) (← links)
• On distance-preserving elimination orderings in graphs: complexity and algorithms (Q1752455) (← links)
• Tuning interval branch-and-prune for protein structure determination (Q1756761) (← links)
• On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data (Q1987024) (← 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)
• A note on the Cayley-Menger determinant and the molecular distance geometry problem (Q2127101) (← links)
• Unassigned distance geometry and molecular conformation problems (Q2131140) (← 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)
• An integer programming approach for the search of discretization orders in distance geometry problems (Q2174886) (← links)
• A constrained interval approach to the generalized distance geometry problem (Q2174890) (← links)
• NMR protein structure calculation and sphere intersections (Q2236703) (← links)
• On the optimality of finding DMDGP symmetries (Q2244000) (← links)
• On the polynomiality of finding \(^K\text{DMDGP}\) re-orders (Q2322885) (← links)
• Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem (Q2361047) (← links)
• Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem (Q2660371) (← links)
• Optimal Discretization Orders for Distance Geometry: A Theoretical Standpoint (Q3304780) (← links)
• Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems (Q5084653) (← links)
• Constraint programming approaches for the discretizable molecular distance geometry problem (Q6065908) (← links)