Pages that link to "Item:Q2392117"

The following pages link to The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances (Q2392117):

Displayed 27 items.

• Discretization orders and efficient computation of Cartesian coordinates for distance geometry (Q476278) ‎ (← links)
• Discretization orders for protein side chains (Q486406) ‎ (← links)
• Discretization vertex orders in distance geometry (Q499358) ‎ (← links)
• Fisher information distance: a geometrical reading (Q499362) ‎ (← 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)
• On the computation of protein backbones by using artificial backbones of hydrogens (Q540709) ‎ (← links)
• Discretization orders for distance geometry problems (Q691496) ‎ (← links)
• The discretizable molecular distance geometry problem (Q694593) ‎ (← links)
• Clifford algebra and the discretizable molecular distance geometry problem (Q888986) ‎ (← links)
• A symmetry-based splitting strategy for discretizable distance geometry problems (Q1668793) ‎ (← links)
• Recent advances on the interval distance geometry problem (Q1683318) ‎ (← links)
• Minimal NMR distance information for rigidity of protein graphs (Q1728101) ‎ (← links)
• Oriented conformal geometric algebra and the molecular distance geometry problem (Q1728194) ‎ (← links)
• Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures (Q1730533) ‎ (← links)
• Preface: Special issue dedicated to distance geometry (Q1756744) ‎ (← links)
• Tuning interval branch-and-prune for protein structure determination (Q1756761) ‎ (← links)
• The discretizable distance geometry problem (Q1926615) ‎ (← links)
• Recent advances on the discretizable molecular distance geometry problem (Q1926689) ‎ (← links)
• Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem (Q2361047) ‎ (← links)
• The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances (Q2392117) ‎ (← links)
• On the number of realizations of certain Henneberg graphs arising in protein conformation (Q2448906) ‎ (← links)
• Solving Distance Geometry Problem with Inexact Distances in Integer Plane (Q2815204) ‎ (← links)
• Optimal partial discretization orders for discretizable distance geometry (Q2827765) ‎ (← links)
• On a Relationship Between Graph Realizability and Distance Matrix Completion (Q4596149) ‎ (← links)
• A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN (Q4608951) ‎ (← links)
• On the Exact Solution of the Distance Geometry with Interval Distances in Dimension 1 (Q4609775) ‎ (← links)