Pages that link to "Item:Q598608"

The following pages link to A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances (Q598608):

Displaying 29 items.

• The unassigned distance geometry problem (Q266818) (← links)
• An algorithm for realizing Euclidean distance matrices (Q324865) (← 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)
• The discretizable molecular distance geometry problem (Q694593) (← links)
• Using a CAS/DGS to analyze computationally the configuration of planar bar linkage mechanisms based on partial Latin squares (Q782688) (← 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)
• Double variable neighbourhood search with smoothing for the molecular distance geometry problem (Q1029680) (← 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)
• Minimal NMR distance information for rigidity of protein graphs (Q1728101) (← links)
• Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures (Q1730533) (← links)
• Recent advances on the discretizable molecular distance geometry problem (Q1926689) (← links)
• Geometric buildup algorithms for sensor network localization (Q1955353) (← links)
• A least-squares approach for discretizable distance geometry problems with inexact distances (Q2174885) (← links)
• A constrained interval approach to the generalized distance geometry problem (Q2174890) (← links)
• An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data (Q2385507) (← links)
• Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem (Q2660371) (← links)
• Euclidean Distance Matrices and Applications (Q2802549) (← links)
• Solving Distance Geometry Problem with Inexact Distances in Integer Plane (Q2815204) (← links)
• Molecular distance geometry methods: from continuous to discrete (Q3087839) (← links)
• A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem (Q3502133) (← links)
• On a Relationship Between Graph Realizability and Distance Matrix Completion (Q4596149) (← links)
• (Q5111761) (← links)
• A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems (Q6155061) (← links)