Multi‐LZerD: Multiple protein docking for asymmetric complexes
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
The tertiary structures of protein complexes provide a crucial insight about the molecular mechanisms that regulate their functions and assembly. However, solving protein complex structures by experimental methods is often more difficult than single protein structures. Here, we have developed a novel computational multiple protein docking algorithm, Multi‐LZerD, that builds models of multimeric complexes by effectively reusing pairwise docking predictions of component proteins. A genetic algorithm is applied to explore the conformational space followed by a structure refinement procedure. Benchmark on eleven hetero‐multimeric complexes resulted in near‐native conformations for all but one of them (a root mean square deviation smaller than 2.5Å). We also show that our method copes with unbound docking cases well, outperforming the methodology that can be directly compared with our approach. Multi‐LZerD was able to predict near‐native structures for multimeric complexes of various topologies.Proteins 2012; © 2012 Wiley Periodicals, Inc.
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
An Introduction to Genetic Algorithms
Mitchell, M. (1996) · doi:10.7551/mitpress/3927.001.0001 · Cited by 11,340
HADDOCK: A Protein−Protein Docking Approach Based on Biochemical or Biophysical Information
Dominguez, C., Boelens, R., & Bonvin, A. M. J. J. (2003) · Journal of the American Chemical Society · doi:10.1021/ja026939x · Cited by 3,187
PatchDock and SymmDock: servers for rigid and symmetric docking
Schneidman-Duhovny, D., Inbar, Y., Nussinov, R., & Wolfson, H. J. (2005) · Nucleic Acids Research · doi:10.1093/nar/gki481 · Cited by 3,018
ZDOCK: An initial‐stage protein‐docking algorithm
Chen, R., Li, L., & Weng, Z. (2003) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.10389 · Cited by 1,393
Cited by
Bertoni, M., Kiefer, F., Biasini, M., Bordoli, L., & Schwede, T. (2017) · Scientific Reports · doi:10.1038/s41598-017-09654-8 · Cited by 866
Structure, Dynamics, Assembly, and Evolution of Protein Complexes
Marsh, J. A., & Teichmann, S. A. (2015) · Annual Review of Biochemistry · doi:10.1146/annurev-biochem-060614-034142 · Cited by 460
Predicting the structure of large protein complexes using AlphaFold and Monte Carlo tree search
(2022) · doi:10.1038/s41467-022-33729-4 · Cited by 226
Evaluation of AlphaFold-Multimer prediction on multi-chain protein complexes
Zhu, W., Shenoy, A., Kundrotas, P., & Elofsson, A. (2023) · Bioinformatics · doi:10.1093/bioinformatics/btad424 · Cited by 202
Blind prediction of homo- and hetero-protein complexes: the CASP13-CAPRI experiment
Lensink, M. F., Brysbaert, G., Nadzirin, N., Velankar, S., Chaleil, R. A. G., Gerguri, T., Bates, P. A., Laine, E., Carbone, A., Grudinin, S., et al. (2019) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.25838 · Cited by 122
Self-citation
Metadata
- Authors
- Esquivel‐Rodríguez, J., Yang, Y. D., & Kihara, D.
- Venue
- Proteins: Structure, Function, and Bioinformatics
- Publisher
- Wiley
- Published
- 2012-05-08
- Volume
- 80
- Issue
- 7
- Pages
- 1818-1833
- ISSN
- 0887-3585 (ISSN-L)
- 1097-0134
- OpenAlex
- W2101980405
- Cited by
- 89
- References
- 4
- FWCI
- 2.44
- 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.