Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Predicting the structure of large protein complexes using AlphaFold and Monte Carlo tree search
Stockholms universitet, Naturvetenskapliga fakulteten, Institutionen för biokemi och biofysik. Stockholms universitet, Science for Life Laboratory (SciLifeLab).ORCID-id: 0000-0003-3439-1866
Stockholms universitet, Naturvetenskapliga fakulteten, Institutionen för biokemi och biofysik. Stockholms universitet, Science for Life Laboratory (SciLifeLab).ORCID-id: 0000-0002-4303-9939
Stockholms universitet, Naturvetenskapliga fakulteten, Institutionen för biokemi och biofysik. Stockholms universitet, Science for Life Laboratory (SciLifeLab).
Stockholms universitet, Naturvetenskapliga fakulteten, Institutionen för biokemi och biofysik. Stockholms universitet, Science for Life Laboratory (SciLifeLab).ORCID-id: 0000-0001-7748-2501
Visa övriga samt affilieringar
Antal upphovsmän: 62022 (Engelska)Ingår i: Nature Communications, E-ISSN 2041-1723, Vol. 13, nr 1, artikel-id 6028Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

AlphaFold 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.

Ort, förlag, år, upplaga, sidor
2022. Vol. 13, nr 1, artikel-id 6028
Nationell ämneskategori
Biologiska vetenskaper
Identifikatorer
URN: urn:nbn:se:su:diva-211010DOI: 10.1038/s41467-022-33729-4ISI: 000867312100019PubMedID: 36224222Scopus ID: 2-s2.0-85139763194OAI: oai:DiVA.org:su-211010DiVA, id: diva2:1709605
Tillgänglig från: 2022-11-09 Skapad: 2022-11-09 Senast uppdaterad: 2023-08-10Bibliografiskt granskad
Ingår i avhandling
1. Decipher protein complex structures from sequence
Öppna denna publikation i ny flik eller fönster >>Decipher protein complex structures from sequence
2023 (Engelska)Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
Abstract [en]

Proteins are essential constituents of biological systems. A profound understanding of protein structure is significant for unraveling the intricate mechanisms of biological processes. The recent development of computational methods using AI technology is revolutionizing the structural biology field. Accurate predictions of three-dimentional protein structures can be generated from protein sequences, enabling rapid and accurate insights into protein interactions and functions. This thesis aims to investigate the applications of various cutting-edge methods in protein complex structure prediction. We first explore using trRosetta for dimeric protein complexes, and the study shows that the single-chain protein structure predictor is feasible for protein complexes. In light of the success of AlphaFold2, we use the pipeline FoldDock, which is an adaption of AlphaFold2 on protein complexes, for protein-protein interactions (PPIs) of two human interactome datasets and construct a PPI network. Next, we conduct a benchmark study of AlphaFold-Multimer in multi-chain protein complexes with 2 to 6 chains and examine how different evaluation scores affect the prediction assessment. In the last paper, we predict the large protein complexes starting from subcomponents using AlphaFold2 and a Monte Carlo Tree Search algorithm. The studies in this thesis show that deep learning approaches can yield reliable results in predicting protein complex structures, and there is ample potential for further improvement. 

Ort, förlag, år, upplaga, sidor
Stockholm: Department of Biochemistry and Biophysics, Stockholm University, 2023. s. 64
Nyckelord
Protein complex structure prediction, protein interaction, AI, AlphaFold
Nationell ämneskategori
Bioinformatik (beräkningsbiologi) Bioinformatik och beräkningsbiologi
Forskningsämne
biokemi med inriktning mot bioinformatik
Identifikatorer
urn:nbn:se:su:diva-219975 (URN)978-91-8014-414-8 (ISBN)978-91-8014-415-5 (ISBN)
Disputation
2023-09-25, Air & Fire, SciLifeLab, Tomtebodavägen 23A, Solna, 14:00 (Engelska)
Opponent
Handledare
Tillgänglig från: 2023-08-31 Skapad: 2023-08-10 Senast uppdaterad: 2025-02-05Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextPubMedScopus

Person

Bryant, PatrickPozzati, GabrieleZhu, WensiShenoy, AditiElofsson, Arne

Sök vidare i DiVA

Av författaren/redaktören
Bryant, PatrickPozzati, GabrieleZhu, WensiShenoy, AditiElofsson, Arne
Av organisationen
Institutionen för biokemi och biofysikScience for Life Laboratory (SciLifeLab)
I samma tidskrift
Nature Communications
Biologiska vetenskaper

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
pubmed
urn-nbn

Altmetricpoäng

doi
pubmed
urn-nbn
Totalt: 172 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf