Shortest-path problems and molecular conformation
From MaRDI portal
Recommendations
- Computational experience with a parallel algorithm for tetrangle inequality bound smoothing
- scientific article; zbMATH DE number 3895768
- Computational experience with an algorithm for tetrangle inequality bound smoothing
- scientific article; zbMATH DE number 2188749
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3895768 (Why is no real title available?)
- scientific article; zbMATH DE number 3331438 (Why is no real title available?)
- A distance geometry program for determining the structures of small proteins and other macromolecules from nuclear magnetic resonance measurements of intramolecular \({}^ 1H-^ 1H\) proximities in solution
- An approach to nonlinear programming
- Tensegrity Frameworks
- The Algebraic Geometry of Stresses in Frameworks
- The art and theory of dynamic programming
- The theory and practice of distance geometry
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
Cited in
(8)- Computational experience with an algorithm for tetrangle inequality bound smoothing
- scientific article; zbMATH DE number 1522763 (Why is no real title available?)
- The cone of distance matrices
- Molecular geometry and conformation: Mathematical relations between intra-molecular distances and conformation in Fréchet-type dendrimers and dendrons
- The embedding problem for predistance matrices
- Molecular conformation search by distance matrix perturbations
- scientific article; zbMATH DE number 3895768 (Why is no real title available?)
- Searching for spreads and packings
This page was built for publication: Shortest-path problems and molecular conformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095924)
