Quadratic Programming Approach to Fit Protein Complexes into Electron Density Maps - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Quadratic Programming Approach to Fit Protein Complexes into Electron Density Maps

(1, 2) , (3, 1, 2) , (3)
1
2
3

Abstract

The paper investigates the problem of fitting protein complexes into electron density maps. They are represented by high-resolution cryoEM density maps converted into overlapping matrices and partly show a structure of a complex. The general purpose is to define positions of all proteins inside it. This problem is known to be NP-hard, since it lays in the field of combinatorial optimization over a set of discrete states of the complex. We introduce quadratic programming approaches to the problem. To find an approximate solution, we convert a density map into an overlapping matrix, which is generally indefinite. Since the matrix is indefinite, the optimization problem for the corresponding quadratic form is non-convex. To treat non-convexity of the optimization problem, we use different convex relaxations to find which set of proteins minimizes the quadratic form best.
Fichier principal
Vignette du fichier
itas.pdf (255.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01419380 , version 1 (19-12-2016)
hal-01419380 , version 2 (07-01-2017)

Licence

Attribution - NonCommercial - NoDerivatives - CC BY 4.0

Identifiers

Cite

Roman Pogodin, Alexander Katrutsa, Sergei Grudinin. Quadratic Programming Approach to Fit Protein Complexes into Electron Density Maps. Information Technology and Systems 2016, Sep 2016, Repino, St. Petersburg, Russia. pp.576-582. ⟨hal-01419380v2⟩
1455 View
156 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More