Using a distributed SDP approach to solve simulated protein molecular conformation problems

DOI10.1007/978-1-4614-5128-0_17MaRDI QIDQ2841714zbMATH OpenOpenAlexFDO

Authors Xingyuan Fang, Kim-Chuan Toh

Publication date 29 July 2013

Published in Distance Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4614-5128-0_17

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Semidefinite programming (90C22) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• An SDP-based divide-and-conquer algorithm for large-scale noisy anchor-free graph realization
• A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
• Recent advances on the discretizable molecular distance geometry problem
• The discretizable molecular distance geometry problem
• Recent advances on the interval distance geometry problem

Cited in

(9)

• Global registration of multiple point clouds using semidefinite programming
• A dual basis approach to multidimensional scaling
• Non-degenerate rigid alignment in a patch framework
• Low-rank matrix completion in a general non-orthogonal basis
• Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints
• A Euclidean distance matrix model for protein molecular conformation
• A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
• Maxent-stress optimization of 3D biomolecular models
• An SDP-based divide-and-conquer algorithm for large-scale noisy anchor-free graph realization

Describes a project that uses

Uses Software

• DISCO
• SNLSDP
• SDPT3

This page was built for publication: Using a distributed SDP approach to solve simulated protein molecular conformation problems

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