scholarly journals Exploring Protein Fold Space

Biomolecules ◽  
2020 ◽  
Vol 10 (2) ◽  
pp. 193 ◽  
Author(s):  
William R. Taylor

The model of protein folding proposed by Ptitsyn and colleagues involves the accretion of secondary structures around a nucleus. As developed by Efimov, this model also provides a useful way to view the relationships among structures. Although somewhat eclipsed by later databases based on the pairwise comparison of structures, Efimov’s approach provides a guide for the more automatic comparison of proteins based on an encoding of their topology as a string. Being restricted to layers of secondary structures based on beta sheets, this too has limitations which are partly overcome by moving to a more generalised secondary structure lattice that can encompass both open and closed (barrel) sheets as well as helical packing of the type encoded by Murzin and Finkelstein on small polyhedra. Regular (crystalline) lattices, such as close-packed hexagonals, were found to be too limited so pseudo-latticses were investigated including those found in quasicrystals and the Bernal tetrahedron-based lattice that he used to represent liquid water. The Bernal lattice was considered best and used to generate model protein structures. These were much more numerous than those seen in Nature, posing the open question of why this might be.

2013 ◽  
Vol 8 (1) ◽  
pp. 5 ◽  
Author(s):  
Xuefeng Cui ◽  
Shuai Cheng Li ◽  
Dongbo Bu ◽  
Babak Alipanahi ◽  
Ming Li

2003 ◽  
Vol 36 (1) ◽  
pp. 125-128 ◽  
Author(s):  
Oliviero Carugo

The most popular estimator of structural similarity is the root-mean-square distance (r.m.s.d.) between equivalent atoms, computed after optimal superposition of the two structures that are compared. It is known that r.m.s.d. values do not depend only on conformational differences but also on other features, for example the dimensions of the structures that are compared. An open question is how they might depend on the accuracy of the experimentally determined protein structures. Given that the accuracy of the protein crystal structures is generally estimated through the crystallographic resolution, it is important to know the dependence of the r.m.s.d. on the crystallographic resolution of the two structures that are compared. 14458 protein structure pairs of identical sequence were compared and the resulting r.m.s.d. values were normalized to 100-residue length to avoid the bias introduced by the dependence of the r.m.s.d. values on the protein-pair dimensions. On average, smaller r.m.s.d. values are associated with protein structure pairs at better resolution and the r.m.s.d. values tend to increase if the two proteins that are compared have been refined at different resolutions. For crystallographic resolutions ranging between 1.6 and 2.9 Å, both relationships appear to be linear: r.m.s.d. = −0.73 + 0.48 resolution and delta_r.m.s.d. = 0.20 + 0.30 delta_resolution (`delta' indicating difference). Although the linearity of these relationships is not expected to hold outside the 1.6–2.9 Å resolution range, they are useful in making the r.m.s.d. values more reliable.


Author(s):  
Michael T. Zimmermann ◽  
Fadi Towfic ◽  
Robert L. Jernigan ◽  
Andrzej Kloczkowski

2012 ◽  
Vol 2012 ◽  
pp. 1-5 ◽  
Author(s):  
Julien Allali ◽  
Cédric Saule ◽  
Cédric Chauve ◽  
Yves d’Aubenton-Carafa ◽  
Alain Denise ◽  
...  

The pairwise comparison of RNA secondary structures is a fundamental problem, with direct application in mining databases for annotating putative noncoding RNA candidates in newly sequenced genomes. An increasing number of software tools are available for comparing RNA secondary structures, based on different models (such as ordered trees or forests, arc annotated sequences, and multilevel trees) and computational principles (edit distance, alignment). We describe here the website BRASERO that offers tools for evaluating such software tools on real and synthetic datasets.


Algorithms ◽  
2018 ◽  
Vol 11 (8) ◽  
pp. 114 ◽  
Author(s):  
Mihaly Mezei

The steady growth of the Protein Data Bank (PDB) suggests the periodic repetition of searches for sequences that form different secondary structures in different protein structures; these are called chameleon sequences. This paper presents a fast (nlog(n)) algorithm for such searches and presents the results on all protein structures in the PDB. The longest such sequence found consists of 20 residues.


2003 ◽  
Vol 330 (4) ◽  
pp. 839-850 ◽  
Author(s):  
Adrian P Cootes ◽  
Stephen H Muggleton ◽  
Michael J.E Sternberg

Sign in / Sign up

Export Citation Format

Share Document