A discrete search algorithm for finding the structure of protein backbones and side chains

Some information about protein structure can be obtained by using Nuclear Magnetic Resonance (NMR) techniques, but they provide only a sparse set of distances between atoms in a protein. The Molecular Distance Geometry Problem (MDGP) consists in determining the three-dimensional structure of a molecule using a set of known distances between some atoms. Recently, a Branch and Prune (BP) algorithm was proposed to calculate the backbone of a protein, based on a discrete formulation for the MDGP. We present an extension of the BP algorithm that can calculate not only the protein backbone, but the whole three-dimensional structure of proteins.

[1]  T. Creighton.  Proteins: Structures and Molecular Properties , 1986 .

[2]  T. N. Bhat,et al.  The Protein Data Bank , 2000, Nucleic Acids Res..

[3]  Qunfeng Dong,et al.  A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances , 2002, J. Glob. Optim..

[4]  Di Wu,et al.  An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data , 2003, J. Glob. Optim..

[5]  C. Lavor.  Analytic evaluation of the gradient and Hessian of molecular potential energy functions , 2007 .

[6]  Leo Liberti,et al.  A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem , 2008, Int. Trans. Oper. Res..

[7]  Carlile Lavor,et al.  Extending the geometric build-up algorithm for the molecular distance geometry problem , 2008, Inf. Process. Lett..

[8]  Kim-Chuan Toh,et al.  A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation , 2008, SIAM J. Sci. Comput..

[9]  Di Wu,et al.  Rigid versus unique determination of protein structures with geometric buildup , 2008, Optim. Lett..

[10]  Leo Liberti,et al.  Molecular Distance Geometry Problem , 2009, Encyclopedia of Optimization.

[11]  Tamar Schlick,et al.  Molecular Modeling and Simulation: An Interdisciplinary Guide , 2010 .

[12]  Leo Liberti,et al.  Molecular distance geometry methods: from continuous to discrete , 2010, Int. Trans. Oper. Res..

[13]  Leo Liberti,et al.  Recent advances on the Discretizable Molecular Distance Geometry Problem , 2012, Eur. J. Oper. Res..

[14]  Leo Liberti,et al.  Discretization orders for distance geometry problems , 2012, Optim. Lett..

[15]  Leo Liberti,et al.  The discretizable molecular distance geometry problem , 2006, Computational Optimization and Applications.