New Error Measures and Methods for Realizing Protein Graphs from Distance Data.

Saved in:

Bibliographic Details
Title:	New Error Measures and Methods for Realizing Protein Graphs from Distance Data.
Authors:	D'Ambrosio, Claudia¹ dambrosio@lix.polytechnique.fr, Vu, Ky¹ vu@lix.polytechnique.fr, Lavor, Carlile² clavor@ime.unicamp.br, Liberti, Leo¹ liberti@lix.polytechnique.fr, Maculan, Nelson³ maculan@cos.ufrj.br
Source:	Discrete & Computational Geometry. Mar2017, Vol. 57 Issue 2, p371-418. 48p.
Subjects:	Distance geometry, Protein conformation, Mathematical programming, Euclidean distance, Standard deviations
Abstract:	The interval distance geometry problem consists in finding a realization in $$\mathbb {R}^K$$ of a simple undirected graph $$G=(V,E)$$ with non-negative intervals assigned to the edges in such a way that, for each edge, the Euclidean distance between the realization of the adjacent vertices is within the edge interval bounds. In this paper, we focus on the application to the conformation of proteins in space, which is a basic step in determining protein function: given interval estimations of some of the inter-atomic distances, find their shape. Among different families of methods for accomplishing this task, we look at mathematical programming based methods, which are well suited for dealing with intervals. The basic question we want to answer is: what is the best such method for the problem? The most meaningful error measure for evaluating solution quality is the coordinate root mean square deviation. We first introduce a new error measure which addresses a particular feature of protein backbones, i.e. many partial reflections also yield acceptable backbones. We then present a set of new and existing quadratic and semidefinite programming formulations of this problem, and a set of new and existing methods for solving these formulations. Finally, we perform a computational evaluation of all the feasible solver $$+$$ formulation combinations according to new and existing error measures, finding that the best methodology is a new heuristic method based on multiplicative weights updates. [ABSTRACT FROM AUTHOR]
	Copyright of Discrete & Computational Geometry is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	The interval distance geometry problem consists in finding a realization in $$\mathbb {R}^K$$ of a simple undirected graph $$G=(V,E)$$ with non-negative intervals assigned to the edges in such a way that, for each edge, the Euclidean distance between the realization of the adjacent vertices is within the edge interval bounds. In this paper, we focus on the application to the conformation of proteins in space, which is a basic step in determining protein function: given interval estimations of some of the inter-atomic distances, find their shape. Among different families of methods for accomplishing this task, we look at mathematical programming based methods, which are well suited for dealing with intervals. The basic question we want to answer is: what is the best such method for the problem? The most meaningful error measure for evaluating solution quality is the coordinate root mean square deviation. We first introduce a new error measure which addresses a particular feature of protein backbones, i.e. many partial reflections also yield acceptable backbones. We then present a set of new and existing quadratic and semidefinite programming formulations of this problem, and a set of new and existing methods for solving these formulations. Finally, we perform a computational evaluation of all the feasible solver $$+$$ formulation combinations according to new and existing error measures, finding that the best methodology is a new heuristic method based on multiplicative weights updates. [ABSTRACT FROM AUTHOR]
ISSN:	01795376
DOI:	10.1007/s00454-016-9846-7