Minimal NMR distance information for rigidity of protein graphs
From MaRDI portal
Publication:1728101
DOI10.1016/j.dam.2018.03.071zbMath1405.05178OpenAlexW2801664259WikidataQ57855480 ScholiaQ57855480MaRDI QIDQ1728101
Thérèse E. Malliavin, Bradley Worley, Benjamin Bardiaux, Leo Liberti, Michael Nilges, Carlile C. Lavor, Bruce Randall Donald
Publication date: 21 February 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc6380886
Applications of graph theory (05C90) Protein sequences, DNA sequences (92D20) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items
A note on the Cayley-Menger determinant and the molecular distance geometry problem, Unassigned distance geometry and molecular conformation problems, The m-Bézout bound and distance geometry, Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem, Boolean combination of circular arcs using orthogonal spheres, Distance geometry and data science, A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems, Efficient development of competitive Mathematica solutions based on geometric algebra with GAALOPWeb, NMR protein structure calculation and sphere intersections, On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data, On the optimality of finding DMDGP symmetries, A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances, On the polynomiality of finding \(^K\text{DMDGP}\) re-orders, A quantum approach to the discretizable molecular distance geometry problem, An asymptotic upper bound for graph embeddings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hyperbolic smoothing and penalty techniques applied to molecular structure determination
- Discretization orders and efficient computation of Cartesian coordinates for distance geometry
- Discretization orders for protein side chains
- Discretization vertex orders in distance geometry
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- On the computation of protein backbones by using artificial backbones of hydrogens
- A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
- Discretization orders for distance geometry problems
- A note on exact algorithms for vertex ordering problems on graphs
- The discretizable molecular distance geometry problem
- Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis
- A distance geometry program for determining the structures of small proteins and other macromolecules from nuclear magnetic resonance measurements of intramolecular \({}^ 1H-^ 1H\) proximities in solution
- Clifford algebra and the discretizable molecular distance geometry problem
- Extending the geometric build-up algorithm for the molecular distance geometry problem
- On the rigidity of molecular graphs
- The algebraic degree of geometric optimization problems
- Recent advances on the interval distance geometry problem
- Connected rigidity matroids and unique realizations of graphs
- The discretizable distance geometry problem
- Recent advances on the discretizable molecular distance geometry problem
- Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- Generic global rigidity
- On graphs and rigidity of plane skeletal structures
- Six mathematical gems from the history of distance geometry
- Distance Geometry
- Molecular distance geometry methods: from continuous to discrete
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Conditions for Unique Graph Realizations
- Clifford algebra and discretizable distance geometry
- An Introduction to Distance Geometry applied to Molecular Geometry
- A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN
- Euclidean Distance Geometry
- Feasibility check for the distance geometry problem: an application to molecular conformations
- Euclidean Distance Geometry and Applications
- Counting the Number of Solutions of KDMDGP Instances
- Computational Experience with the Molecular Distance Geometry Problem
