Pages that link to "Item:Q2660371"

The following pages link to Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem (Q2660371):

Displaying 7 items.

• Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis (Q778422) (← links)
• Tuning interval branch-and-prune for protein structure determination (Q1756761) (← links)
• A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances (Q2041974) (← 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)
• NMR protein structure calculation and sphere intersections (Q2236703) (← links)
• The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances (Q2392117) (← links)