Pages that link to "Item:Q2448906"

The following pages link to On the number of realizations of certain Henneberg graphs arising in protein conformation (Q2448906):

Displaying 28 items.

• Discretization vertex orders in distance geometry (Q499358) (← 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)
• Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis (Q778422) (← links)
• A symmetry-based splitting strategy for discretizable distance geometry problems (Q1668793) (← links)
• Recent advances on the interval distance geometry problem (Q1683318) (← links)
• Realizing Euclidean distance matrices by sphere intersection (Q1728090) (← links)
• Equivalent realisations of a rigid graph (Q1728093) (← 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)
• A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances (Q2041974) (← links)
• A quantum approach to the discretizable molecular distance geometry problem (Q2101499) (← links)
• The referenced vertex ordering problem: theory, applications, and solution methods (Q2165588) (← links)
• A least-squares approach for discretizable distance geometry problems with inexact distances (Q2174885) (← links)
• The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry (Q2174889) (← links)
• A constrained interval approach to the generalized distance geometry problem (Q2174890) (← links)
• Distance geometry and data science (Q2192022) (← links)
• On the maximal number of real embeddings of minimally rigid graphs in \(\mathbb{R}^2,\mathbb{R}^3\) and \(S^2\) (Q2200306) (← links)
• On the optimality of finding DMDGP symmetries (Q2244000) (← links)
• Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension (Q2274754) (← links)
• On the polynomiality of finding \(^K\text{DMDGP}\) re-orders (Q2322885) (← links)
• Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem (Q2660371) (← links)
• Optimal partial discretization orders for discretizable distance geometry (Q2827765) (← links)
• Distance Geometry on the Sphere (Q2958102) (← links)
• The Number of Realizations of a Laman Graph (Q4564015) (← links)
• Lower Bounds on the Number of Realizations of Rigid Graphs (Q5114449) (← 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)