The K-discretization and K-incident graphs for discretizable distance geometry

DOI10.1007/S11590-018-1294-2zbMATH Open1442.90158OpenAlexW2811067641WikidataQ62562103 ScholiaQ62562103MaRDI QIDQ2174889FDOQ2174889

Authors: Germano Abud, Jorge Alencar, Leo Liberti, Carlile Lavor, Antonio Mucherino 

Publication date: 27 April 2020

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-018-1294-2

Recommendations

• Discretization orders for distance geometry problems
• Discretization vertex orders in distance geometry
• Optimal partial discretization orders for discretizable distance geometry
• The discretizable distance geometry problem
• An integer programming approach for the search of discretization orders in distance geometry problems

zbMATH Keywords

discretizationcombinatorial optimizationdistance geometryvertex orders

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Euclidean distance geometry and applications
• A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
• The discretizable molecular distance geometry problem
• The discretizable distance geometry problem
• The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
• Discretization orders for distance geometry problems
• Molecular distance geometry methods: from continuous to discrete
• On the number of realizations of certain Henneberg graphs arising in protein conformation
• Recent advances on the interval distance geometry problem
• Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem
• Optimal partial discretization orders for discretizable distance geometry

Cited In (5)

• An impossible combinatorial counting method in distance geometry
• Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
• Optimal partial discretization orders for discretizable distance geometry
• On the Identification of Discretization Orders for Distance Geometry with Intervals
• Discretization vertex orders in distance geometry

This page was built for publication: The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry

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