The unassigned distance geometry problem

DOI10.1016/J.DAM.2015.10.029MaRDI QIDQ266818zbMATH OpenOpenAlexFDO

Authors L. Granlund, S. R. Gujarathi, P. Juhas, P. M. Duxbury, Simon J. L. Billinge

Publication date 7 April 2016

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.dam.2015.10.029

zbMATH Keywords

LIGAnanostructurepercolationrigid clusterTRIBONDunassigned distances

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial aspects of finite geometries (05B25) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• Unassigned distance geometry and molecular conformation problems
• Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
• Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
• Molecular distance geometry methods: from continuous to discrete
• Recent advances on the discretizable molecular distance geometry problem

Cites work

• scientific article; zbMATH DE number 3859878 (Why is no real title available?)
• scientific article; zbMATH DE number 17636 (Why is no real title available?)
• scientific article; zbMATH DE number 2188749 (Why is no real title available?)
• A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
• A point set puzzle revisited
• A proof of the molecular conjecture
• An algorithm for two-dimensional rigidity percolation: The pebble game
• An efficient algorithm for testing the generic rigidity of graphs in the plane
• An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
• Characterizing generic global rigidity
• Conditions for Unique Graph Realizations
• Connected rigidity matroids and unique realizations of graphs
• Euclidean distance geometry and applications
• Generic global rigidity
• Generic rigidity in three-dimensional bond-bending networks
• On graphs and rigidity of plane skeletal structures
• Rigid components in molecular graphs
• Rigid versus unique determination of protein structures with geometric buildup
• Sudden emergence of a giant k-core in a random graph
• The Molecule Problem: Exploiting Structure in Global Optimization
• WHICH POINT CONFIGURATIONS ARE DETERMINED BY THE DISTRIBUTION OF THEIR PAIRWISE DISTANCES?

Cited in

(10)

• Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
• Coordinate difference matrices
• Preface: Special issue dedicated to distance geometry
• Unassigned distance geometry and molecular conformation problems
• Trilateration using unlabeled path or loop lengths
• An application-based characterization of dynamical distance geometry problems
• Clustering analysis of a dissimilarity: a review of algebraic and geometric representation
• Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
• The distance orientation problem
• Algorithm for distance list extraction from pair distribution functions

Describes a project that uses

Uses Software

• CNS

This page was built for publication: The unassigned distance geometry problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q266818)