Topological determinants of protein folding
Open accessThe DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Abstract
The folding of many small proteins is kinetically a two-state process that represents overcoming the major free-energy barrier. A kinetic characteristic of a conformation, its probability to descend to the native state domain in the amount of time that represents a small fraction of total folding time, has been introduced to determine to which side of the free-energy barrier a conformation belongs. However, which features make a protein conformation on the folding pathway become committed to rapidly descending to the native state has been a mystery. Using two small, well characterized proteins, CI2 and C-Src SH3, we show how topological properties of protein conformations determine their kinetic ability to fold. We use a macroscopic measure of the protein contact network topology, the average graph connectivity , by constructing graphs that are based on the geometry of protein conformations. We find that the average connectivity is higher for conformations with a high folding probability than for those with a high probability to unfold. Other macroscopic measures of protein structural and energetic properties such as radius of gyration, rms distance, solvent-accessible surface area, contact order, and potential energy fail to serve as predictors of the probability of a given conformation to fold.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Bollobás, B. (1985) · Cited by 6,196
The Large-Scale Organization of Metabolic Networks
Jeong, H., Tombor, B., Albert, R., Oltvai, Z. N., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35036627 · Cited by 4,972
Havlin, S., & Ben-Avraham, D. (1987) · Advances in Physics · doi:10.1080/00018738700101072 · Cited by 1,808
Plaxco, K. W., Simons, K. T., & Baker, D. (1998) · Journal of Molecular Biology · doi:10.1006/jmbi.1998.1645 · Cited by 1,518
Clementi, C., Nymeyer, H., & Onuchic, J. N. (2000) · Journal of Molecular Biology · doi:10.1006/jmbi.2000.3693 · Cited by 1,240
Theoretical Studies of Protein Folding
Go, N. (1983) · Annual Review of Biophysics and Bioengineering · doi:10.1146/annurev.bb.12.060183.001151 · Cited by 824
Itzhaki, L. S., Otzen, D. E., & Fersht, A. R. (1995) · Journal of Molecular Biology · doi:10.1006/jmbi.1995.0616 · Cited by 733
On the transition coordinate for protein folding
Du, R., Pande, V. S., Grosberg, A. Y., Tanaka, T., & Shakhnovich, E. S. (1998) · The Journal of Chemical Physics · doi:10.1063/1.475393 · Cited by 486
Self-citation
Cited by
Network Analysis of Protein Structures Identifies Functional Residues
Amitai, G., Shemesh, A., Sitbon, E., Shklar, M., Netanely, D., Venger, I., & Pietrokovski, S. (2004) · Journal of Molecular Biology · doi:10.1016/j.jmb.2004.10.055 · Cited by 499
A Network Representation of Protein Structures: Implications for Protein Stability
Brinda, K. V., & Vishveshwara, S. (2005) · Biophysical Journal · doi:10.1529/biophysj.105.064485 · Cited by 442
The RING 2.0 web server for high quality residue interaction networks
Piovesan, D., Minervini, G., & Tosatto, S. C. E. (2016) · Nucleic Acids Research · doi:10.1093/nar/gkw315 · Cited by 415
Das, P., Moll, M., Stamati, H., Kavraki, L. E., & Clementi, C. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0603553103 · Cited by 331
“It has been argued that the parameter Pf old , defined as the probability of a protein structure to reach the folded state before the unfolded state, would serve as ideal exact reaction coordinate for protein folding studies [2, 8, 14, 22, 23].”
BackgroundResidues crucial for maintaining short paths in network communication mediate signaling in proteins
del Sol, A., Fujihashi, H., Amoros, D., & Nussinov, R. (2006) · Molecular Systems Biology · doi:10.1038/msb4100063 · Cited by 331
Small-World Communication of Residues and Significance for Protein Dynamics
Atilgan, A. R., Akan, P., & Baysal, C. (2004) · Biophysical Journal · doi:10.1016/s0006-3495(04)74086-2 · Cited by 327
Uncovering Network Systems Within Protein Structures
Greene, L. H., & Higman, V. A. (2003) · Journal of Molecular Biology · doi:10.1016/j.jmb.2003.08.061 · Cited by 287
Protein Contact Networks: An Emerging Paradigm in Chemistry
Di Paola, L., De Ruvo, M., Paci, P., Santoni, D., & Giuliani, A. (2013) · Chemical Reviews · doi:10.1021/cr3002356 · Cited by 269
Controlling Allosteric Networks in Proteins
Dokholyan, N. V. (2016) · Chemical Reviews · doi:10.1021/acs.chemrev.5b00544 · Cited by 260
Self-citationThe modular architecture of protein–protein binding interfaces
Reichmann, D., Rahat, O., Albeck, S., Meged, R., Dym, O., & Schreiber, G. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0407280102 · Cited by 239
P versus Q : Structural reaction coordinates capture protein folding on smooth landscapes
Cho, S. S., Levy, Y., & Wolynes, P. G. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0509768103 · Cited by 223
Topological explanations and robustness in biological sciences
Huneman, P. (2010) · Synthese · doi:10.1007/s11229-010-9842-z · Cited by 211
“They960 pertain to morphology, but also to the lowest level of biological organization—for961 example protein folding, as explained by molecular biology (Dokholyan et al. 2002),962 where especially small-worlds networks entail important properties (Vendruscolo et al.963 2002).”
BackgroundMishra, S., Pandey, N., Rawat, A., Srivastava, D., Ray, A., & Kumar, V. (2023) · IEEE Access · doi:10.1109/access.2023.3337260
Metadata
- Authors
- Dokholyan, N. V., Li, L., Ding, F., & Shakhnovich, E. I.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2002-06-25
- Volume
- 99
- Issue
- 13
- Pages
- 8637-8641
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2049277949
- Cited by
- 292
- References
- 24
- FWCI
- 4.32
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.