The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins
From MaRDI portal
Publication:2841697
DOI10.1007/978-1-4614-5128-0_3zbMath1366.92094MaRDI QIDQ2841697
Leo Liberti, Antonio Mucherino, Carlile C. Lavor
Publication date: 29 July 2013
Published in: Distance Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-5128-0_3
05C90: Applications of graph theory
92D20: Protein sequences, DNA sequences
51K05: General theory of distance geometry
92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
Related Items
Discretization vertex orders in distance geometry, Assigned and unassigned distance geometry: applications to biological molecules and nanostructures, New error measures and methods for realizing protein graphs from distance data, The discretizable distance geometry problem, Diagonally Dominant Programming in Distance Geometry, Distance Geometry on the Sphere
Uses Software