Pages that link to "Item:Q1926615"
From MaRDI portal
The following pages link to The discretizable distance geometry problem (Q1926615):
Displayed 10 items.
- Discretization orders and efficient computation of Cartesian coordinates for distance geometry (Q476278) (← links)
- Discretization vertex orders in distance geometry (Q499358) (← links)
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures (Q503659) (← links)
- Discretization orders for distance geometry problems (Q691496) (← links)
- Clifford algebra and the discretizable molecular distance geometry problem (Q888986) (← links)
- Recent advances on the discretizable molecular distance geometry problem (Q1926689) (← 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)
- Optimal partial discretization orders for discretizable distance geometry (Q2827765) (← links)
- Distance Geometry on the Sphere (Q2958102) (← links)