On the number of realizations of certain Henneberg graphs arising in protein conformation
From MaRDI portal
Publication:2448906
Recommendations
- scientific article; zbMATH DE number 873806
- A new graph theoretic approach for protein threading
- On the rigidity of molecular graphs
- Some applications of graph theory to the study of polymer configuration
- Lower bounds on the number of realizations of rigid graphs
- Combinatorics of contacts in protein contact maps
Cites work
- scientific article; zbMATH DE number 3917126 (Why is no real title available?)
- scientific article; zbMATH DE number 501471 (Why is no real title available?)
- scientific article; zbMATH DE number 2188749 (Why is no real title available?)
- scientific article; zbMATH DE number 3080144 (Why is no real title available?)
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- Conditions for Unique Graph Realizations
- Discretization orders for distance geometry problems
- Generic global rigidity
- Infinitesimally Rigid Polyhedra. I. Statics of Frameworks
- Infinitesimally Rigid Polyhedra. II: Modified Spherical Frameworks
- MD-jeep: an implementation of a branch and prune algorithm for distance geometry problems
- Molecular distance geometry methods: from continuous to discrete
- Molecular modeling and simulation. An interdisciplinary guide
- On Products of Euclidean Reflections
- On the computation of protein backbones by using artificial backbones of hydrogens
- On the definition of artificial backbones for the discretizable molecular distance geometry problem
- On the number of solutions of the discretizable molecular distance geometry problem
- Problems of distance geometry and convex properties of quadratic maps
- Reconstructing a three-dimensional model with arbitrary errors
- Reliable computation of the points of intersection of \(n\) spheres in \({\mathbb{R}}^n\)
- Rigidity Matroids
- Sphere and dot product representations of graphs
- The discretizable distance geometry problem
- The discretizable molecular distance geometry problem
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- Theory of semidefinite programming for sensor network localization
- Universal Rigidity and Edge Sparsification for Sensor Network Localization
Cited in
(31)- On a relationship between graph realizability and distance matrix completion
- On rigidity and realizability of weighted graphs
- The number of realizations of a Laman graph
- An impossible combinatorial counting method in distance geometry
- Oriented conformal geometric algebra and the molecular distance geometry problem
- Realizing Euclidean distance matrices by sphere intersection
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- Recent advances on the interval distance geometry problem
- On the polynomiality of finding \(^K\text{DMDGP}\) re-orders
- The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry
- Lower bounds on the number of realizations of rigid graphs
- A least-squares approach for discretizable distance geometry problems with inexact distances
- A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems
- Equivalent realisations of a rigid graph
- Minimal NMR distance information for rigidity of protein graphs
- A constrained interval approach to the generalized distance geometry problem
- Optimal partial discretization orders for discretizable distance geometry
- Distance geometry and data science
- On the maximal number of real embeddings of minimally rigid graphs in \(\mathbb{R}^2,\mathbb{R}^3\) and \(S^2\)
- A quantum approach to the discretizable molecular distance geometry problem
- Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension
- A new algorithm for the \(^K\mathrm{DMDGP}\) subclass of distance geometry problems with exact distances
- A symmetry-based splitting strategy for discretizable distance geometry problems
- On the optimality of finding DMDGP symmetries
- Discretization vertex orders in distance geometry
- Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis
- Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem
- Distance geometry on the sphere
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- New error measures and methods for realizing protein graphs from distance data
- The referenced vertex ordering problem: theory, applications, and solution methods
This page was built for publication: On the number of realizations of certain Henneberg graphs arising in protein conformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448906)
