Pages that link to "Item:Q1728101"

The following pages link to Minimal NMR distance information for rigidity of protein graphs (Q1728101):

Displaying 17 items.

• The m-Bézout bound and distance geometry (Q831957) (← 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)
• An asymptotic upper bound for graph embeddings (Q2112663) (← 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)
• Distance geometry and data science (Q2192022) (← links)
• Efficient development of competitive Mathematica solutions based on geometric algebra with GAALOPWeb (Q2204138) (← 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)
• Boolean combination of circular arcs using orthogonal spheres (Q2422695) (← links)
• Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem (Q2660371) (← links)
• Extended Abstract: Structure Determination of Symmetric Protein Complexes by a Complete Search of Symmetry Configuration Space Using NMR Distance Restraints (Q3564321) (← 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)