Solving distance geometry problem with inexact distances in integer plane
From MaRDI portal
Recommendations
- Molecular distance geometry methods: from continuous to discrete
- New methods for the distance geometry problem
- A least-squares approach for discretizable distance geometry problems with inexact distances
- Discretization orders and efficient computation of Cartesian coordinates for distance geometry
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
Cites work
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
- An Experimental Study on Distance-Based Graph Drawing
- Distance Geometry
- Distance geometry optimization for protein structures
- Euclidean distance geometry and applications
- Graph Drawing
- scientific article; zbMATH DE number 2129318 (Why is no real title available?)
- scientific article; zbMATH DE number 3080144 (Why is no real title available?)
- Molecular distance geometry methods: from continuous to discrete
- The discretizable molecular distance geometry problem
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
This page was built for publication: Solving distance geometry problem with inexact distances in integer plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815204)