The discretizable molecular distance geometry problem (Q694593): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 01:00, 10 December 2024

scientific article

Language	Label	Description	Also known as
English	The discretizable molecular distance geometry problem	scientific article

Statements

scholarly article

0 references

The discretizable molecular distance geometry problem (English)

0 references

0 references

Antonio Mucherino

0 references

Carlile C. Lavor

0 references

Nelson F. Maculan

0 references

Computational Optimization and Applications

0 references

publication date

13 December 2012

0 references

full work available at URL

https://arxiv.org/abs/q-bio/0608012

0 references

http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.1606

0 references

zbMATH Keywords

distance geometry

0 references

branch-and-prune

0 references

molecular conformation

0 references

protein

0 references

NMR

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming

0 references

Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach

0 references

The lattice of faces of a finite dimensional cone

0 references

Reconstructing a three-dimensional model with arbitrary errors

0 references

0 references

A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation

0 references

0 references

0 references

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

0 references

Generic global rigidity

0 references

0 references

Equality relating Euclidean distance cone to positive semidefinite cone

0 references

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

0 references

A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data

0 references

An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix

0 references

Solving molecular distance geometry problems by global optimization algorithms

0 references

The Molecule Problem: Exploiting Structure in Global Optimization

0 references

Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems

0 references

An interior-point method for approximate positive semidefinite completions

0 references

The Solution of the Metric STRESS and SSTRESS Problems in Multidimensional Scaling Using Newtons Method

0 references

Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions

0 references

0 references

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

0 references

Computational Experience with the Molecular Distance Geometry Problem

0 references

0 references

Recent advances on the discretizable molecular distance geometry problem

0 references

Discretization orders for distance geometry problems

0 references

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

0 references

Double variable neighbourhood search with smoothing for the molecular distance geometry problem

0 references

Molecular distance geometry methods: from continuous to discrete

0 references

On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem

0 references

Global Continuation for Distance Geometry Problems

0 references

Distance geometry optimization for protein structures

0 references

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

0 references

MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems

0 references

0 references

Rigid and Flexible Frameworks

0 references

Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem

0 references

Molecular modeling and simulation. An interdisciplinary guide

0 references

Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert''

0 references

Theory of semidefinite programming for sensor network localization

0 references

An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data

0 references

Rigid versus unique determination of protein structures with geometric buildup

0 references

A stochastic/perturbation global optimization algorithm for distance geometry problems

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

0 references

10.1007/S10589-011-9402-6

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:694593

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q694593&oldid=38447995"