On the computation of protein backbones by using artificial backbones of hydrogens
From MaRDI portal
(Redirected from Publication:540709)
Recommendations
- On the definition of artificial backbones for the discretizable molecular distance geometry problem
- The discretizable molecular distance geometry problem seems easier on proteins
- The discretizable molecular distance geometry problem
- Distance geometry in structural biology: new perspectives
- An introduction to distance geometry applied to molecular geometry
Cites work
- scientific article; zbMATH DE number 2188749 (Why is no real title available?)
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
- A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- Computational Experience with the Molecular Distance Geometry Problem
- Distance geometry optimization for protein structures
- Double variable neighbourhood search with smoothing for the molecular distance geometry problem
- Extending the geometric build-up algorithm for the molecular distance geometry problem
- Global Continuation for Distance Geometry Problems
- LAPACK Users' Guide
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- 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 generating instances for the modular distance geometry problem
- On the definition of artificial backbones for the discretizable molecular distance geometry problem
- Optimization by simulated annealing
- Rigid versus unique determination of protein structures with geometric buildup
- Solving molecular distance geometry problems by global optimization algorithms
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
Cited in
(18)- On a relationship between graph realizability and distance matrix completion
- On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- Recent advances on the interval distance geometry problem
- The interval ordering problem
- The discretizable molecular distance geometry problem
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- Minimal NMR distance information for rigidity of protein graphs
- Preface: Special issue dedicated to distance geometry
- On the definition of artificial backbones for the discretizable molecular distance geometry problem
- Faster placement of hydrogens in protein structures by dynamic programming
- Preface
- Discretization orders for distance geometry problems
- Discretization orders for protein side chains
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- Recent advances on the discretizable molecular distance geometry problem
- The discretizable distance geometry problem
This page was built for publication: On the computation of protein backbones by using artificial backbones of hydrogens
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540709)
