Oriented Conformal Geometric Algebra and the Molecular Distance Geometry Problem

The problem of 3D protein structure determination using distance information from nuclear magnetic resonance (NMR) experiments is a classical problem in distance geometry. NMR data and the chemistry of proteins provide a way to define a protein backbone order such that the distances related to the p...

Full description

Saved in:
Bibliographic Details
Published in:Advances in applied Clifford algebras Vol. 29; no. 1; pp. 1 - 15
Main Authors: Lavor, Carlile, Alves, Rafael
Format: Journal Article
Language:English
Published: Cham Springer International Publishing 01.02.2019
Springer Nature B.V
Subjects:
Algorithms
Angles (geometry)
Applications of Mathematics
Atomic radius
Combinatorial analysis
Homage to Prof. W.A. Rodrigues Jr
Mathematical and Computational Physics
Mathematical Methods in Physics
NMR
Nuclear magnetic resonance
Organic chemistry
Physics
Physics and Astronomy
Proteins
Pruning
Theoretical
Distance geometry
3D protein structure
Oriented conformal geometric algebra
Branch and prune algorithm
ISSN:0188-7009, 1661-4909
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The problem of 3D protein structure determination using distance information from nuclear magnetic resonance (NMR) experiments is a classical problem in distance geometry. NMR data and the chemistry of proteins provide a way to define a protein backbone order such that the distances related to the pairs of atoms { i - 3 , i } , { i - 2 , i } , { i - 1 , i } are available, implying a combinatorial method to solve the problem, called branch-and-prune (BP). There are two main steps in BP algorithm: the first one (the branching phase) is to intersect three spheres centered at the positions for atoms i - 3 , i - 2 , i , with radius given by the atomic distances d i - 3 , i , d i - 2 , i , d i - 1 , i , respectively, to obtain two possible positions for atom i ; and the second one (the pruning phase) is to check if additional spheres (related to distances d j , i , j < i - 3 ) can be used to select one of the two possibilities for atom i . Differently from distances d i - 2 , i , d i - 1 , i (associated to bond lenghts and bond angles), distances d j , i , j ≤ i - 3 , may not be precise. BP algorithm has difficulties to deal with uncertainties, and this paper proposes the oriented conformal geometric algebra to take care of intersection of spheres when their centers and radius are not precise.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0188-7009
1661-4909
DOI:10.1007/s00006-018-0925-0