DISCRETE APPROACHES FOR SOLVING MOLECULAR DISTANCE GEOMETRY PROBLEMS USING NMR DATA

  • Lavor C
  • Mucherino A
  • Liberti L
  • et al.
N/ACitations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

The molecular distance geometry problem (MDGP) is the problem of finding the conformation of a molecule by exploiting known distances between some pairs of its atoms. Estimates of the distances between the atoms can be obtained through experiments of nuclear magnetic resonance (NMR) spectroscopy. The information on the distances, however, is usually limited, because only distances between hydrogens and shorter than 6 A are usually available, and this makes the solution of the MDGP quite hard. In this paper, we focus our attention on protein backbones and we present a methodology for computing their full-atom conformations starting from NMR data. This task is performed by solving two MDGPs. First of all, only hydrogens are considered: we define an artificial backbone of hydrogens for which particular assumptions needed for the discretization of the problem are satisfied. This allows for solving the first MDGP with an ad hoc algorithm. Secondly, by exploiting the coordinates of the hydrogens and known bond lengths and bond angles, we compute the coordinates of the other atoms forming the protein backbone by using a polynomial-time algorithm. Computational experiments related to real proteins are presented.

Cite

CITATION STYLE

APA

Lavor, C., Mucherino, A., Liberti, L., & Maculan, N. (2010). DISCRETE APPROACHES FOR SOLVING MOLECULAR DISTANCE GEOMETRY PROBLEMS USING NMR DATA. International Journal of Computational Bioscience, 1(1). https://doi.org/10.2316/j.2010.210-1025

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free