Shortest-path problems and molecular conformation

DOI10.1016/0166-218X(88)90009-1zbMath0633.05041MaRDI QIDQ1095924

Andreas W. M. Dress, Timothy F. Havel

Publication date: 1988

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

distancesalgorithmdistance limitstetrangle inequalitytriangle limits

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Chemistry (92Exx)

Related Items (5)

The cone of distance matrices ⋮ Computational experience with an algorithm for tetrangle inequality bound smoothing ⋮ The embedding problem for predistance matrices ⋮ Molecular conformation search by distance matrix perturbations ⋮ Searching for spreads and packings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The theory and practice of distance geometry
• 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
• Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
• The art and theory of dynamic programming
• An approach to nonlinear programming
• The Algebraic Geometry of Stresses in Frameworks
• Tensegrity Frameworks

This page was built for publication: Shortest-path problems and molecular conformation