The unassigned distance geometry problem
From MaRDI portal
Publication:266818
DOI10.1016/j.dam.2015.10.029zbMath1333.05093OpenAlexW2200439770MaRDI QIDQ266818
S. R. Gujarathi, L. Granlund, P. Juhas, Simon J. L. Billinge, Phillip M. Duxbury
Publication date: 7 April 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.10.029
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)
Related Items
Unassigned distance geometry and molecular conformation problems ⋮ Trilateration using unlabeled path or loop lengths ⋮ 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 ⋮ Preface: Special issue dedicated to distance geometry ⋮ Coordinate Difference Matrices ⋮ Clustering analysis of a dissimilarity: a review of algebraic and geometric representation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A proof of the molecular conjecture
- 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
- Rigid components in molecular graphs
- An algorithm for two-dimensional rigidity percolation: The pebble game
- Connected rigidity matroids and unique realizations of graphs
- Sudden emergence of a giant \(k\)-core in a random graph
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- Generic global rigidity
- A point set puzzle revisited
- On graphs and rigidity of plane skeletal structures
- WHICH POINT CONFIGURATIONS ARE DETERMINED BY THE DISTRIBUTION OF THEIR PAIRWISE DISTANCES?
- Characterizing generic global rigidity
- Generic rigidity in three-dimensional bond-bending networks
- Conditions for Unique Graph Realizations
- An efficient algorithm for testing the generic rigidity of graphs in the plane
- The Molecule Problem: Exploiting Structure in Global Optimization
- Euclidean Distance Geometry and Applications