Show simple item record

dc.contributor.authorBryant, Patrick
dc.contributor.authorPozzati, Gabriele
dc.contributor.authorZhu, Wensi
dc.contributor.authorShenoy, Aditi
dc.contributor.authorKundrotas, Petras
dc.contributor.authorElofsson, Arne
dc.date.accessioned2023-02-20T19:23:54Z
dc.date.available2023-02-20T19:23:54Z
dc.date.issued2022-10-12
dc.identifier.citationBryant, P., Pozzati, G., Zhu, W. et al. Predicting the structure of large protein complexes using AlphaFold and Monte Carlo tree search. Nat Commun 13, 6028 (2022). https://doi.org/10.1038/s41467-022-33729-4en_US
dc.identifier.urihttp://hdl.handle.net/1808/33862
dc.description.abstractAlphaFold can predict the structure of single- and multiple-chain proteins with very high accuracy. However, the accuracy decreases with the number of chains, and the available GPU memory limits the size of protein complexes which can be predicted. Here we show that one can predict the structure of large complexes starting from predictions of subcomponents. We assemble 91 out of 175 complexes with 10–30 chains from predicted subcomponents using Monte Carlo tree search, with a median TM-score of 0.51. There are 30 highly accurate complexes (TM-score ≥0.8, 33% of complete assemblies). We create a scoring function, mpDockQ, that can distinguish if assemblies are complete and predict their accuracy. We find that complexes containing symmetry are accurately assembled, while asymmetrical complexes remain challenging. The method is freely available and accesible as a Colab notebook https://colab.research.google.com/github/patrickbryant1/MoLPC/blob/master/MoLPC.ipynb.en_US
dc.publisherNature Researchen_US
dc.rights© The Author(s) 2022. This article is licensed under a Creative Commons Attribution 4.0 International License.en_US
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/en_US
dc.subjectMolecular modellingen_US
dc.subjectProtein structure predictionsen_US
dc.subjectProteinsen_US
dc.titlePredicting the structure of large protein complexes using AlphaFold and Monte Carlo tree searchen_US
dc.typeArticleen_US
kusw.kuauthorKundrotas, Petras
kusw.kudepartmentCenter for Computational Biologyen_US
dc.identifier.doi10.1038/s41467-022-33729-4en_US
kusw.oaversionScholarly/refereed, publisher versionen_US
kusw.oapolicyThis item meets KU Open Access policy criteria.en_US
dc.identifier.pmidPMC9556563en_US
dc.rights.accessrightsopenAccessen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

© The Author(s) 2022. This article is licensed under a Creative Commons Attribution 4.0 International License.
Except where otherwise noted, this item's license is described as: © The Author(s) 2022. This article is licensed under a Creative Commons Attribution 4.0 International License.