Pages that link to "Item:Q517453"
From MaRDI portal
The following pages link to New error measures and methods for realizing protein graphs from distance data (Q517453):
Displaying 14 items.
- 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)
- On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data (Q1987024) (← links)
- A cycle-based formulation for the distance geometry problem (Q2056892) (← 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)
- Maximum feasible subsystems of distance geometry constraints (Q2131137) (← links)
- Unassigned distance geometry and molecular conformation problems (Q2131140) (← links)
- NMR protein structure calculation and sphere intersections (Q2236703) (← links)
- Barvinok's naive algorithm in distance geometry (Q2294219) (← links)
- On the polynomiality of finding \(^K\text{DMDGP}\) re-orders (Q2322885) (← links)
- A multiplicative weights update algorithm for MINLP (Q2397756) (← links)
- Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem (Q2660371) (← links)
- Cycle-based formulations in distance geometry (Q6114894) (← links)
