Minimal NMR distance information for rigidity of protein graphs (Q1728101)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Minimal NMR distance information for rigidity of protein graphs

scientific article; zbMATH DE number 7027415

Language	Label	Description	Also known as
default for all languages	No label defined
English	Minimal NMR distance information for rigidity of protein graphs	scientific article; zbMATH DE number 7027415

Statements

instance of

scholarly article

0 references

title

Minimal NMR distance information for rigidity of protein graphs (English)

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Discrete Applied Mathematics

0 references

publication date

21 February 2019

0 references

full work available at URL

http://europepmc.org/articles/pmc6380886

0 references

zbMATH Keywords

nuclear magnetic resonance

0 references

molecular structure

0 references

distance geometry

0 references

vertex orders

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Feasibility check for the distance geometry problem: an application to molecular conformations

0 references

Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem

0 references

Clifford algebra and discretizable distance geometry

0 references

The algebraic degree of geometric optimization problems

0 references

Q3996250

0 references

Assigned and unassigned distance geometry: applications to biological molecules and nanostructures

0 references

Q5818996

0 references

A note on exact algorithms for vertex ordering problems on graphs

0 references

Extending the geometric build-up algorithm for the molecular distance geometry problem

0 references

Discretization vertex orders in distance geometry

0 references

Generic global rigidity

0 references

Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis

0 references

Discretization orders for protein side chains

0 references

Q5461825

0 references

A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances

0 references

Q4076414

0 references

Discretization orders and efficient computation of Cartesian coordinates for distance geometry

0 references

Recent advances on the interval distance geometry problem

0 references

Q4279195

0 references

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

0 references

Conditions for Unique Graph Realizations

0 references

Connected rigidity matroids and unique realizations of graphs

0 references

On the rigidity of molecular graphs

0 references

On graphs and rigidity of plane skeletal structures

0 references

Clifford algebra and the discretizable molecular distance geometry problem

0 references

Discretization orders for distance geometry problems

0 references

An introduction to distance geometry applied to molecular geometry

0 references

Computational Experience with the Molecular Distance Geometry Problem

0 references

The discretizable molecular distance geometry problem

0 references

Recent advances on the discretizable molecular distance geometry problem

0 references

The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances

0 references

On the computation of protein backbones by using artificial backbones of hydrogens

0 references

Six mathematical gems from the history of distance geometry

0 references

Euclidean distance geometry. An introduction

0 references

Counting the Number of Solutions of KDMDGP Instances

0 references

A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem

0 references

Euclidean distance geometry and applications

0 references

Molecular distance geometry methods: from continuous to discrete

0 references

On the number of realizations of certain Henneberg graphs arising in protein conformation

0 references

A note on computing the intersection of spheres in \(\mathbb{R}^n\)

0 references

The discretizable distance geometry problem

0 references

Distance Geometry

0 references

Hyperbolic smoothing and penalty techniques applied to molecular structure determination

0 references

Q3694165

0 references

Identifiers

zbMATH Open document ID

1405.05178

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

10.1016/J.DAM.2018.03.071

0 references

Sitelinks

Mathematics(1 entry)

mardi Minimal NMR distance information for rigidity of protein graphs