Pages that link to "Item:Q2385507"

The following pages link to An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data (Q2385507):

Displaying 19 items.

• The unassigned distance geometry problem (Q266818) (← links)
• Hyperbolic smoothing and penalty techniques applied to molecular structure determination (Q408445) (← links)
• Solving a generalized distance geometry problem for protein structure determination (Q417280) (← links)
• Assigned and unassigned distance geometry: applications to biological molecules and nanostructures (Q503659) (← links)
• On the computation of protein backbones by using artificial backbones of hydrogens (Q540709) (← links)
• Least-squares approximations in geometric buildup for solving distance geometry problems (Q637550) (← links)
• Discretization orders for distance geometry problems (Q691496) (← links)
• The discretizable molecular distance geometry problem (Q694593) (← links)
• Rigid versus unique determination of protein structures with geometric buildup (Q941022) (← links)
• Extending the geometric build-up algorithm for the molecular distance geometry problem (Q975461) (← links)
• A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation (Q1048270) (← links)
• Recent advances on the interval distance geometry problem (Q1683318) (← links)
• Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures (Q1730533) (← links)
• The discretizable distance geometry problem (Q1926615) (← links)
• Recent advances on the discretizable molecular distance geometry problem (Q1926689) (← links)
• Geometric buildup algorithms for sensor network localization (Q1955353) (← links)
• Euclidean Distance Matrices and Applications (Q2802549) (← links)
• Molecular distance geometry methods: from continuous to discrete (Q3087839) (← links)
• A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN (Q4608951) (← links)