Pages that link to "Item:Q503659"
From MaRDI portal
The following pages link to Assigned and unassigned distance geometry: applications to biological molecules and nanostructures (Q503659):
Displaying 27 items.
- 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)
- Preface: Special issue dedicated to distance geometry (Q1756744) (← links)
- On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data (Q1987024) (← links)
- A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix (Q1993487) (← links)
- On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs (Q2025442) (← links)
- Graph reconstruction from unlabeled edge lengths (Q2039322) (← links)
- 4OR comes of age. Editorial note (Q2040603) (← 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)
- New upper bounds for the number of embeddings of minimally rigid graphs (Q2172653) (← 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)
- Barvinok's naive algorithm in distance geometry (Q2294219) (← links)
- On the polynomiality of finding \(^K\text{DMDGP}\) re-orders (Q2322885) (← links)
- Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem (Q2660371) (← links)
- A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN (Q4608951) (← links)
- On the Exact Solution of the Distance Geometry with Interval Distances in Dimension 1 (Q4609775) (← links)
- Global Rigidity of Unit Ball Graphs (Q5210905) (← links)
- Preface (Q5970304) (← links)
- Algorithm for distance list extraction from pair distribution functions (Q6547563) (← links)
- An impossible combinatorial counting method in distance geometry (Q6558675) (← links)
