Computational experience with an algorithm for tetrangle inequality bound smoothing

DOI10.1007/BF02458843MaRDI QIDQ1111968zbMATH OpenOpenAlexWikidataFDO

Authors Peter L. Easthope, T. F. Havel

Publication date 1989

Published in Bulletin of Mathematical Biology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02458843

zbMATH Keywords

bound smoothing algorithmscomputer programsinteratomic distancesmolecular biologynuclear magnetic resonance dataproteinsquadruple of atomstetrangle inequality limits

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to biology (92-04) Computational methods for problems pertaining to biology (92-08) Physiological, cellular and medical topics (92Cxx)

Recommendations

• scientific article; zbMATH DE number 1154585
• Double variable neighbourhood search with smoothing for the molecular distance geometry problem
• Computational experience with a parallel algorithm for tetrangle inequality bound smoothing
• Shortest-path problems and molecular conformation
• scientific article; zbMATH DE number 1161372

Cites work

• scientific article; zbMATH DE number 2188749 (Why is no real title available?)
• scientific article; zbMATH DE number 3331438 (Why is no real title available?)
• Shortest-path problems and molecular conformation
• The theory and practice of distance geometry

Cited in

(6)

• Shortest-path problems and molecular conformation
• The embedding problem for predistance matrices
• Searching for spreads and packings
• scientific article; zbMATH DE number 1154585 (Why is no real title available?)
• scientific article; zbMATH DE number 1161372 (Why is no real title available?)
• Computational experience with a parallel algorithm for tetrangle inequality bound smoothing

This page was built for publication: Computational experience with an algorithm for tetrangle inequality bound smoothing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111968)