CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2008 vol.5 Issue No.03 - July-September
Issue No.03 - July-September (2008 vol.5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2008.27
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 Ångstroms allow reconstructing 3D models that are very similar to the proteins native structure.
Combinatorial algorithms, Contact map, Molecular Modeling, Protein structure prediction
Marco Vassura, Luciano Margara, Pietro Di Lena, Filippo Medri, Piero Fariselli, Rita Casadio, "Reconstruction of 3D Structures From Protein Contact Maps", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.5, no. 3, pp. 357-367, July-September 2008, doi:10.1109/TCBB.2008.27