Pages that link to "Item:Q691496"

The following pages link to Discretization orders for distance geometry problems (Q691496):

Displaying 29 items.

• Discretization orders and efficient computation of Cartesian coordinates for distance geometry (Q476278) (← links)
• Discretization orders for protein side chains (Q486406) (← links)
• Discretization vertex orders in distance geometry (Q499358) (← 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)
• The discretizable molecular distance geometry problem (Q694593) (← links)
• Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis (Q778422) (← links)
• Recent advances on the interval distance geometry problem (Q1683318) (← links)
• Minimal NMR distance information for rigidity of protein graphs (Q1728101) (← links)
• Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures (Q1730533) (← links)
• The discretizable distance geometry problem (Q1926615) (← links)
• Recent advances on the discretizable molecular distance geometry problem (Q1926689) (← links)
• On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data (Q1987024) (← 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)
• An integer programming approach for the search of discretization orders in distance geometry problems (Q2174886) (← links)
• The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry (Q2174889) (← links)
• On the optimality of finding DMDGP symmetries (Q2244000) (← 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)
• Six mathematical gems from the history of distance geometry (Q2827761) (← 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)
• 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)