AIDA: ab initio domain assembly for automated multi-domain protein structure prediction and domain–domain interaction prediction
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Motivation: Most proteins consist of multiple domains, independent structural and evolutionary units that are often reshuffled in genomic rearrangements to form new protein architectures. Template-based modeling methods can often detect homologous templates for individual domains, but templates that could be used to model the entire query protein are often not available. Results: We have developed a fast docking algorithm ab initio domain assembly (AIDA) for assembling multi-domain protein structures, guided by the ab initio folding potential. This approach can be extended to discontinuous domains (i.e. domains with ‘inserted’ domains). When tested on experimentally solved structures of multi-domain proteins, the relative domain positions were accurately found among top 5000 models in 86% of cases. AIDA server can use domain assignments provided by the user or predict them from the provided sequence. The latter approach is particularly useful for automated protein structure prediction servers. The blind test consisting of 95 CASP10 targets shows that domain boundaries could be successfully determined for 97% of targets. Availability and implementation: The AIDA package as well as the benchmark sets used here are available for download at http://ffas.burnham.org/AIDA/. Contact: adam@sanfordburnham.org 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
Zhou, H., & Zhou, Y. (2002) · Protein Science · doi:10.1110/ps.0217002 · Cited by 902
Protein length in eukaryotic and prokaryotic proteomes
Brocchieri, L. (2005) · Nucleic Acids Research · doi:10.1093/nar/gki615 · Cited by 414
Cited by
Zhou, X., Zheng, W., Li, Y., Pearce, R., Zhang, C., Bell, E. W., Zhang, G., & Zhang, Y. (2022) · Nature Protocols · doi:10.1038/s41596-022-00728-0 · Cited by 519
The structural coverage of the human proteome before and after AlphaFold
Porta-Pardo, E., Ruiz-Serra, V., Valentini, S., & Valencia, A. (2022) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1009818 · Cited by 131
“Overall, we have practically completed our coverage of the human foldable proteome, an outstanding achievement that will open the door to more challenging problems in structural biology in general and in biomedicine in particular, such as the prediction of protein-protein interaction complexes[43,44][45], the relative…”
BackgroundStructural analogue-based protein structure domain assembly assisted by deep learning
Peng, C.-X., Zhou, X.-G., Xia, Y.-H., Liu, J., Hou, M.-H., & Zhang, G.-J. (2022) · Bioinformatics · doi:10.1093/bioinformatics/btac553 · Cited by 21
(2024) · doi:10.1016/j.fmre.2024.05.003 · Cited by 7
E2EDA: Protein Domain Assembly Based on End-to-End Deep Learning
(2023) · doi:10.1021/acs.jcim.3c01387 · Cited by 6
Metadata
- Authors
- Xu, D., Jaroszewski, L., Li, Z., & Godzik, A.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2015-02-19
- Volume
- 31
- Issue
- 13
- Pages
- 2098-2105
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2170449429
- Cited by
- 58
- References
- 3
- FWCI
- 2.06
- Type
- journal article
- Language
- en
- Open access
- bronze
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.