The following pages link to Distance Geometry (Q2901787):
Displaying 33 items.
- Estimating the number of tetrahedra determined by volume, circumradius and four face areas using Groebner basis (Q277227) (← links)
- 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)
- Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis (Q778422) (← links)
- Clifford algebra and the discretizable molecular distance geometry problem (Q888986) (← links)
- Determining the metric and the symmetry group of finite point sets in space with an application to cyclohexane (Q1703409) (← 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)
- On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data (Q1987024) (← links)
- A note on the Cayley-Menger determinant and the molecular distance geometry problem (Q2127101) (← links)
- Preface: Special issue on distances in optimization and graphs dedicated to the memory of Michel Deza (Q2174868) (← links)
- Nonlinear mapping and distance geometry (Q2174887) (← links)
- A constrained interval approach to the generalized distance geometry problem (Q2174890) (← links)
- An application-based characterization of dynamical distance geometry problems (Q2174892) (← links)
- Generalization of Schläfli formula to the volume of a spherically faced simplex (Q2176578) (← links)
- Distance geometry and data science (Q2192022) (← links)
- NMR protein structure calculation and sphere intersections (Q2236703) (← links)
- On the polynomiality of finding \(^K\text{DMDGP}\) re-orders (Q2322885) (← links)
- Multidimensional scaling in dually flat spaces (Q2352138) (← 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)
- Solving Distance Geometry Problem with Inexact Distances in Integer Plane (Q2815204) (← 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)
- 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)
- (Q5111761) (← links)
- Preface (Q5965755) (← links)
- On distance graph coloring problems (Q6070499) (← links)
- Computing Circuit Polynomials in the Algebraic Rigidity Matroid (Q6161559) (← links)
