Pages that link to "Item:Q2392117"
From MaRDI portal
The following pages link to The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances (Q2392117):
Displaying 5 items.
- Discretization orders for protein side chains (Q486406) (← 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 discretizable molecular distance geometry problem (Q1926689) (← links)
- A constrained interval approach to the generalized distance geometry problem (Q2174890) (← links)
