The K-discretization and K-incident graphs for discretizable distance geometry
From MaRDI portal
Publication:2174889
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
Cites work
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Discretization orders for distance geometry problems
- Euclidean distance geometry and applications
- Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem
- Molecular distance geometry methods: from continuous to discrete
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- Optimal partial discretization orders for discretizable distance geometry
- Recent advances on the interval distance geometry problem
- The discretizable distance geometry problem
- The discretizable molecular distance geometry problem
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
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
- Discretization vertex orders in distance geometry
- On the Identification of Discretization Orders for Distance Geometry with Intervals
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)
