On the Reconstruction of Three-dimensional Protein Structures from Contact Maps

被引:2
作者
Di Lena, Pietro [1 ]
Vassura, Marco [1 ]
Margara, Luciano [1 ]
Fariselli, Piero [2 ]
Casadio, Rita [2 ]
机构
[1] Univ Bologna, Dept Comp Sci, Via Mura Anteo Zamboni,7, I-40127 Bologna, Italy
[2] Univ Bologna, Dept Biol, Biocomp Grp, I-40127 Bologna, Italy
关键词
Protein folding; contact map; molecular modeling;
D O I
10.3390/a2010076
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The problem of protein structure prediction is one of the long-standing goals of Computational Biology. Although we are still not able to provide first principle solutions, several shortcuts have been discovered to compute the protein three-dimensional structure when similar protein sequences are available (by means of comparative modeling and remote homology detection). Nonetheless, these approaches can assign structures only to a fraction of proteins in genomes and ab-initio methods are still needed. One relevant step of ab-initio prediction methods is the reconstruction of the protein structures starting from inter-protein residue contacts. In this paper we review the methods developed so far to accomplish the reconstruction task in order to highlight their differences and similarities. The different approaches are fully described and their reported performances, together with their computational complexity, are also discussed.
引用
收藏
页码:76 / 92
页数:17
相关论文
共 22 条
[1]   PRINCIPLES THAT GOVERN FOLDING OF PROTEIN CHAINS [J].
ANFINSEN, CB .
SCIENCE, 1973, 181 (4096) :223-230
[3]   The effect of backbone on the small-world properties of protein contact maps [J].
Bartoli, L. ;
Fariselli, P. ;
Casadio, R. .
PHYSICAL BIOLOGY, 2007, 4 (04) :L1-L5
[4]  
Bartoli Lisa, 2008, V413, P199
[5]  
Bau D., 2007, ANAL BIOLOGICAL DATA
[6]  
Blumental L. M., 1953, THEORY APPL DISTANCE
[7]   PROTEIN STRUCTURES FROM DISTANCE INEQUALITIES [J].
BOHR, J ;
BOHR, H ;
BRUNAK, S ;
COTTERILL, RMJ ;
FREDHOLM, H ;
LAUTRUP, B ;
PETERSEN, SB .
JOURNAL OF MOLECULAR BIOLOGY, 1993, 231 (03) :861-869
[8]   Unit disk graph recognition is NP-hard [J].
Breu, H ;
Kirkpatrick, DG .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1998, 9 (1-2) :3-24
[9]  
Cormen T. H., 2009, INTRO ALGORITHMS, V3rd
[10]  
Crippen G.M., 1988, DISTANCE GEOMETRY MO