Pages that link to "Item:Q2841697"
From MaRDI portal
The following pages link to The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins (Q2841697):
Displaying 11 items.
- Discretization vertex orders in distance geometry (Q499358) (← links)
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures (Q503659) (← links)
- New error measures and methods for realizing protein graphs from distance data (Q517453) (← links)
- Recent advances on the interval distance geometry problem (Q1683318) (← links)
- Equivalent realisations of a rigid graph (Q1728093) (← links)
- Tuning interval branch-and-prune for protein structure determination (Q1756761) (← links)
- The discretizable distance geometry problem (Q1926615) (← links)
- A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances (Q2041974) (← links)
- Distance geometry and data science (Q2192022) (← links)
- Diagonally Dominant Programming in Distance Geometry (Q2835679) (← links)
- Distance Geometry on the Sphere (Q2958102) (← links)
