Reconstruction of 3D Structures From Protein Contact Maps

The prediction of the protein tertiary structure from solely its residue sequence (the so called Protein Folding Problem) is one of the most challenging problems in Structural Bioinformatics. We focus on the protein residue contact map. When this map is assigned it is possible to reconstruct the 3D structure of the protein backbone. The general problem of recovering a set of 3D coordinates consistent with some given contact map is known as a unit-disk-graph realization problem and it has been recently proven to be NP-Hard. In this paper we describe a heuristic method (COMAR) that is able to reconstruct with an unprecedented rate (3-15 seconds) a 3D model that exactly matches the target contact map of a protein. Working with a non-redundant set of 1760 proteins, we find that the scoring efficiency of finding a 3D model very close to the protein native structure depends on the threshold value adopted to compute the protein residue contact map. Contact maps whose threshold values range from 10 to 18 Aringngstroms allow reconstructing 3D models that are very similar to the proteins native structure.

[1]  Jorge J. Moré,et al.  Distance Geometry Optimization for Protein Structures , 1999, J. Glob. Optim..

[2]  Tim J. P. Hubbard,et al.  SCOP database in 2004: refinements integrate structure and sequence family data , 2004, Nucleic Acids Res..

[3]  Leonard M. Blumenthal,et al.  Theory and applications of distance geometry , 1954 .

[4]  P Fariselli,et al.  Progress in predicting inter‐residue contacts of proteins with neural networks and correlated mutations , 2001, Proteins.

[5]  M Vendruscolo,et al.  Protein folding using contact maps. , 1999, Vitamins and hormones.

[6]  S Brunak,et al.  Protein structures from distance inequalities. , 1993, Journal of molecular biology.

[7]  M Vendruscolo,et al.  Recovery of protein structure from contact maps. , 1997, Folding & design.

[8]  Pierre Baldi,et al.  Modular DAG-RNN Architectures for Assembling Coarse Protein Structures , 2006, J. Comput. Biol..

[9]  Garland R. Marshall,et al.  Properties of intraglobular contacts in proteins: an approach to prediction of tertiary structure , 1994, 1994 Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences.

[10]  Piero Fariselli,et al.  Reconstruction of the protein structures from contact maps , 2006 .

[11]  M. Levitt,et al.  A lattice model for protein structure prediction at low resolution. , 1992, Proceedings of the National Academy of Sciences of the United States of America.

[12]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[13]  G. Vriend,et al.  Prediction of protein conformational freedom from distance constraints , 1997, Proteins.

[14]  Piero Fariselli,et al.  Reconstruction of 3D Structures from Protein Contact Maps , 2007, ISBRA.

[15]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[16]  Timothy F. Havel.  Distance Geometry: Theory, Algorithms, and Chemical Applications , 2002 .

[17]  Gordon M. Crippen,et al.  Distance Geometry and Molecular Conformation , 1988 .

[18]  David G. Kirkpatrick,et al.  Unit disk graph recognition is NP-hard , 1998, Comput. Geom..

[19]  David A. Fenstermacher,et al.  Introduction to bioinformatics , 2005, J. Assoc. Inf. Sci. Technol..

[20]  Piero Fariselli,et al.  The pros and cons of predicting protein contact maps. , 2008, Methods in molecular biology.

[21]  Jorge J. Moré,et al.  E-optimal solutions to distance geometry problems via global continuation , 1995, Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding.