On the computation of protein backbones by using artificial backbones of hydrogens
DOI10.1007/S10898-010-9584-YzbMATH Open1219.90209OpenAlexW1984522181WikidataQ62562186 ScholiaQ62562186MaRDI QIDQ540709FDOQ540709
Nelson Maculan, Carlile Lavor, Antonio Mucherino, Leo Liberti
Publication date: 3 June 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9584-y
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
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Cites Work
- LAPACK Users' Guide
- Optimization by Simulated Annealing
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- Title not available (Why is that?)
- A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
- Rigid versus unique determination of protein structures with geometric buildup
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- Global Continuation for Distance Geometry Problems
- On generating instances for the modular distance geometry problem
- Solving molecular distance geometry problems by global optimization algorithms
- Molecular modeling and simulation. An interdisciplinary guide
- Double variable neighbourhood search with smoothing for the molecular distance geometry problem
- Computational Experience with the Molecular Distance Geometry Problem
- Distance geometry optimization for protein structures
- 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
- Extending the geometric build-up algorithm for the molecular distance geometry problem
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- Molecular distance geometry methods: from continuous to discrete
- Title not available (Why is that?)
- MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems
Cited In (16)
- 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
- Faster placement of hydrogens in protein structures by dynamic programming
- Preface
- On a Relationship Between Graph Realizability and Distance Matrix Completion
- Discretization orders for distance geometry problems
- Recent advances on the discretizable molecular distance geometry problem
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- The discretizable distance geometry problem
Uses Software
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)
