The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins

DOI10.1007/978-1-4614-5128-0_3zbMath1366.92094OpenAlexW1674342371MaRDI 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

zbMATH Keywords

symmetrydistance geometryfixed-parameter tractableprotein conformationBranch-and-Prune

Mathematics Subject Classification ID

Applications of graph theory (05C90) Protein sequences, DNA sequences (92D20) General theory of distance geometry (51K05) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (11)

The discretizable distance geometry problem ⋮ Recent advances on the interval distance geometry problem ⋮ Distance geometry and data science ⋮ Distance Geometry on the Sphere ⋮ Equivalent realisations of a rigid graph ⋮ 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 ⋮ Tuning interval branch-and-prune for protein structure determination ⋮ A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances ⋮ Diagonally Dominant Programming in Distance Geometry

Uses Software

• MD-jeep

This page was built for publication: The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins