A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances (Q2041974)

scientific article

Language	Label	Description	Also known as
English	A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances	scientific article

Statements

instance of

scholarly article

0 references

title

A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances (English)

0 references

0 references

0 references

0 references

0 references

0 references

26 July 2021

0 references

full work available at URL

https://arxiv.org/abs/2009.05404

0 references

zbMATH Keywords

distance geometry

0 references

discretization

0 references

symmetries

0 references

DMDGP

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Realizing Euclidean distance matrices by sphere intersection

0 references

On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data

0 references

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

0 references

Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures

0 references

Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension

0 references

Discretization vertex orders in distance geometry

0 references

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

0 references

Q5461825

0 references

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

0 references

A symmetry-based splitting strategy for discretizable distance geometry problems

0 references

Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions

0 references

Minimal NMR distance information for rigidity of protein graphs

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 optimality of finding DMDGP symmetries

0 references

Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem

0 references

On the polynomiality of finding \(^K\text{DMDGP}\) re-orders

0 references

Distance geometry and data science

0 references

Euclidean Distance Geometry

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

The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins

0 references

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

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

0 references

Distance geometry optimization for protein structures

0 references

The discretizable distance geometry problem

0 references

On the Identification of Discretization Orders for Distance Geometry with Intervals

0 references

A note on the Cayley-Menger determinant and the molecular distance geometry problem

0 references

Solving the Discretizable Molecular Distance Geometry Problem by Multiple Realization Trees

0 references

Identifiers

DOI

10.1007/s00453-021-00835-6

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2041974