Coarse-grained parallelization of distance-bound smoothing for the molecular conformation problem
From MaRDI portal
Recommendations
- Searching for spreads and packings
- Generating edge-disjoint sets of quadruples in parallel for the molecular conformation problem
- scientific article; zbMATH DE number 833650
- Computational experience with a parallel algorithm for tetrangle inequality bound smoothing
- Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis
Cited in
(6)- Double variable neighbourhood search with smoothing for the molecular distance geometry problem
- Parallel computation of alpha complexes for biomolecules
- Searching for spreads and packings
- Generating edge-disjoint sets of quadruples in parallel for the molecular conformation problem
- Modelling of protein surface using parallel heterogeneous architectures
- Hyperbolic smoothing and penalty techniques applied to molecular structure determination
This page was built for publication: Coarse-grained parallelization of distance-bound smoothing for the molecular conformation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414560)