Computational experience with an algorithm for tetrangle inequality bound smoothing

DOI10.1007/BF02458843zbMATH Open0658.92011OpenAlexW4244533457WikidataQ52544317 ScholiaQ52544317MaRDI QIDQ1111968FDOQ1111968

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

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

zbMATH Keywords

proteinsmolecular biologyinteratomic distancescomputer programsbound smoothing algorithmsnuclear magnetic resonance dataquadruple 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)

Cites Work

• Title not available (Why is that?)
• The theory and practice of distance geometry
• Title not available (Why is that?)
• Shortest-path problems and molecular conformation

Cited In (4)

• Shortest-path problems and molecular conformation
• Computational experience with a parallel algorithm for tetrangle inequality bound smoothing
• The embedding problem for predistance matrices
• Searching for spreads and packings

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)