Reconstructing a three-dimensional model with arbitrary errors
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1256764
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- Molecular conformation search by distance matrix perturbations
- Maximum feasible subsystems of distance geometry constraints
- Calculation of coordinates from incomplete and incorrect distance data
Cited in
(16)- Calculation of coordinates from incomplete and incorrect distance data
- Preface: Special issue dedicated to distance geometry
- Maximum feasible subsystems of distance geometry constraints
- Planar straight-line realizations of 2-trees with prescribed edge lengths
- LRA: local rigid averaging of stretchable non-rigid shapes
- Barvinok's naive algorithm in distance geometry
- Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- Unique low rank completability of partially filled matrices
- scientific article; zbMATH DE number 1256764 (Why is no real title available?)
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- Solving partial differential equations on manifolds from incomplete interpoint distance
- Preface
- Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
- The discretizable molecular distance geometry problem
- Clifford algebra and the discretizable molecular distance geometry problem
This page was built for publication: Reconstructing a three-dimensional model with arbitrary errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3158536)