IEEE/ACM Transactions on Computational Biology and Bioinformatics · 2008 · 95 citations · 13 references
Life SciencesBiochemistryBioinformaticsProtein FoldingStructural BioinformaticsStructural BiologyContact Map PredictionProtein StructureProtein Structure ModelingHeuristic AlgorithmsProtein Backbone GeometryProtein Contact Map PredictionProtein Contact MapsProtein Structure DeterminationProtein Tertiary Structure PredictionResidue-residue Contact PredictionTertiary Structure Modeling
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 Angstroms allow reconstructing 3D models that are very similar to the proteins native structure.
13
Adhi Harmoko S, M.Komp, Joseph Marie Jacquard et al. · 2005 · 18.4K citations
Distance geometry and molecular conformation
Choice Reviews Online · 1989 · 734 citations
Unit disk graph recognition is NP-hard
Heinz Breu, David Kirkpatrick · Computational Geometry · 1998 · 313 citations