pyconsFold: a fast and easy tool for modeling and docking using distance predictions
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Motivation: Contact predictions within a protein have recently become a viable method for accurate prediction of protein structure. Using predicted distance distributions has been shown in many cases to be superior to only using a binary contact annotation. Using predicted interprotein distances has also been shown to be able to dock some protein dimers. Results: Here, we present pyconsFold. Using CNS as its underlying folding mechanism and predicted contact distance it outperforms regular contact prediction-based modeling on our dataset of 210 proteins. It performs marginally worse than the state-of-the-art pyRosetta folding pipeline but is on average about 20 times faster per model. More importantly pyconsFold can also be used as a fold-and-dock protocol by using predicted interprotein contacts/distances to simultaneously fold and dock two protein chains. Availability and implementation: pyconsFold is implemented in Python 3 with a strong focus on using as few dependencies as possible for longevity. It is available both as a pip package in Python 3 and as source code on GitHub and is published under the GPLv3 license. The data underlying this article together with source code are available on github, at https://github.com/johnlamb/pyconsfold. Supplementary information: Supplementary data are available at Bioinformatics online.
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
How significant is a protein structure similarity with TM-score = 0.5?
Xu, J., & Zhang, Y. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq066 · Cited by 1,142
Critical assessment of methods of protein structure prediction (CASP)—Round XIII
Kryshtafovych, A., Schwede, T., Topf, M., Fidelis, K., & Moult, J. (2019) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.25823 · Cited by 506
DockQ: A Quality Measure for Protein-Protein Docking Models
Basu, S., & Wallner, B. (2016) · PLOS ONE · doi:10.1371/journal.pone.0161879 · Cited by 460 · cited 1×
“Replacing the interchain distances with predicted contacts significantly lowers the DockQ-score (Basu and Wallner, 2016), but the individual models TMscore does not decrease to the same extent, indicating that interchain contact predictions are less accurate.”
Background
Cited by
Improved prediction of protein-protein interactions using AlphaFold2
Bryant, P., Pozzati, G., & Elofsson, A. (2021) · doi:10.1101/2021.09.15.460468 · Cited by 1,022
Self-citationLimits and potential of combined folding and docking
Pozzati, G., Zhu, W., Bassot, C., Lamb, J., Kundrotas, P., & Elofsson, A. (2022) · Bioinformatics · doi:10.1093/bioinformatics/btab760 · Cited by 25
Self-citationSi, Y., & Yan, C. (2023) · Briefings in Bioinformatics · doi:10.1093/bib/bbad039 · Cited by 25
Structural coverage of the human interactome
Kosoglu, K., Aydin, Z., Tuncbag, N., Gursoy, A., & Keskin, O. (2023) · Briefings in Bioinformatics · doi:10.1093/bib/bbad496 · Cited by 21
OPUS-Fold3: a gradient-based protein all-atom folding and docking framework on TensorFlow
Xu, G., Luo, Z., Zhou, R., Wang, Q., & Ma, J. (2023) · Briefings in Bioinformatics · doi:10.1093/bib/bbad365 · Cited by 1
Metadata
- Authors
- Lamb, J., & Elofsson, A.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2021-07-08
- Volume
- 37
- Issue
- 21
- Pages
- 3959-3960
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W3179008260
- Cited by
- 6
- References
- 3
- FWCI
- 0.34
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.