Driftstörningar
Det förekommer återkommande driftstörningar på några av sök-portalerna på grund av hög belastning. Vi arbetar på att lösa problemet, ni kan tillfälligt mötas av ett felmeddelande.
Ä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
The evolutionary history of topological variations in the CPA/AT superfamily
Stockholms universitet, Naturvetenskapliga fakulteten, Institutionen för biokemi och biofysik. Science for Life Laboratory, Sweden.
Stockholms universitet, Naturvetenskapliga fakulteten, Institutionen för biokemi och biofysik. Science for Life Laboratory, Sweden.
Stockholms universitet, Naturvetenskapliga fakulteten, Institutionen för biokemi och biofysik. Science for Life Laboratory, Sweden.ORCID-id: 0000-0003-0568-8281
Visa övriga samt affilieringar
(Engelska)Manuskript (preprint) (Övrigt vetenskapligt)
Abstract [en]

CPA/AT transporters consist of two structurally and evolutionarily related inverted repeat units, each of them with one core and one scaffold subdomain. During evolution, these families have undergone substantial changes in structure, topology and function. Central to the function of the transporters is the existence of two noncanonical helices that are involved in the transport process. In different families, two different types of these helices have been identified, reentrant and broken. Here, we use an integrated topology annotation method to identify novel topologies in the families. It combines topology prediction, similarity to families with known structure, and the difference in positively charged residues present in inside and outside loops in alternative topological models. We identified families with diverse topologies containing broken or reentrant helix. We classified all families based on 3 distinct evolutionary groups that each share a structurally similar C-terminal repeat unit newly termed as “Fold-types”. Using the evolutionary relationship between families we propose topological transitions including, a transition between broken and reentrant helices, complete change of orientation, changes in the number of scaffold helices and even in some rare cases, losses of core helices. The evolutionary history of the repeat units shows gene duplication and repeat shuffling events to result in these extensive topology variations. The novel structure-based classification, together with supporting structural models and other information, is presented in a searchable database, CPAfold (cpafold.bioinfo.se). Our comprehensive study of topology variations within the CPA superfamily provides better insight about their structure and evolution.

Nyckelord [en]
Contact, prediction, trRosetta, DCA, protein evolution, membrane proteins
Nationell ämneskategori
Bioinformatik (beräkningsbiologi)
Forskningsämne
biokemi med inriktning mot bioinformatik
Identifikatorer
URN: urn:nbn:se:su:diva-191208DOI: 10.1101/2020.12.13.422607OAI: oai:DiVA.org:su-191208DiVA, id: diva2:1536953
Tillgänglig från: 2021-03-12 Skapad: 2021-03-12 Senast uppdaterad: 2022-02-25Bibliografiskt granskad
Ingår i avhandling
1. Transmembrane Proteins and Protein Structure Prediction: What we can learn from Computational Methods
Öppna denna publikation i ny flik eller fönster >>Transmembrane Proteins and Protein Structure Prediction: What we can learn from Computational Methods
2021 (Engelska)Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
Abstract [en]

A protein’s 3D-structure is essential to understand how proteins function and interact and how biochemical processes proceed in organic life. Despite the advancement in experimental methods, it remains expensive and time-consuming to determine protein structure experimentally. There have been significant advances in machine learning and computational methods where, in many cases, models of protein structure can be determined to a high level of quality. Using computational methods helps predict protein 3D-structure and is often used complementary to experimental methods to give better insight and understanding of biological processes.

This thesis presents studies focusing on the simplicity and transparency of the 3D-structure pipeline. This is done with a new interactive database with full access to the pipeline’s data and code together with tools to analyse and compare models and structures. 

I present a new module for the last step in this pipeline, the final folding of the protein chain, which both simplifies the current pipeline and uses new input data based on the current research. This module predicts better models than its predecessor and produces models more than a magnitude faster than the current state-of-the-art tools. This module also contains a novel way of both folding and docking dimers in one single step. 

There are many examples of how machine learning models contain biases that originate in biased training data, translating into models that do not generalise well. I present a study where experts collaborate to create a high-quality database of Intrinsically Disordered Proteins. Through manual annotation and quality protocols, high-quality training data has been produced that is well suited for machine learning tasks and protein disorder analysis. In this thesis, I also present computational methods pertaining to transmembrane proteins and how they can increase our insight into membrane protein structure. In one study, we use computational methods together with experimental methods to investigate how differently charged residue pairs that form salt bridges inside the membrane of membrane proteins changes the insertion potential. We show that amino acid pairs that form salt bridges in this setting contribute 0.5-0.7 kcal/mol to membrane insertion’s apparent free energy. This gives new insight and advances in how we calculate insertion and can lead to better membrane protein topology predictors. In the final study, we investigate the CPA/AT-transporter family of transmembrane proteins and create a new integrated topology annotation method and structural classification, resulting in new insight into how this family evolved through time. The entire pipeline is published as an interactive database with complete transparency for both the method and data used. The study shows how this family has evolved by duplicating internal regions and how this has caused a structural symmetry in the family. 

This thesis, therefore, contributes to a more accessible and more transparent path of using computational methods to give a more extensive insight into protein structure prediction and how these structures pertain to biochemical processes.

Ort, förlag, år, upplaga, sidor
Stockholm: Department of Biochemistry and Biophysics, Stockholm University, 2021. s. 57
Nyckelord
protein structure prediction, contact prediction, transmembrane protein, topology prediction, machine learning
Nationell ämneskategori
Bioinformatik (beräkningsbiologi)
Forskningsämne
biokemi med inriktning mot bioinformatik
Identifikatorer
urn:nbn:se:su:diva-191211 (URN)978-91-7911-456-5 (ISBN)978-91-7911-457-2 (ISBN)
Disputation
2021-04-30, Magnélisalen, Kemiska övningslaboratoriet, Svante Arrhenius väg 16 B, and online via Zoom, public link is available at the department website, Stockholm, 10:00 (Engelska)
Opponent
Handledare
Tillgänglig från: 2021-04-07 Skapad: 2021-03-12 Senast uppdaterad: 2022-02-25Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltext

Person

Bassot, ClaudioLamb, JohnElofsson, Arne

Sök vidare i DiVA

Av författaren/redaktören
Bassot, ClaudioLamb, JohnElofsson, Arne
Av organisationen
Institutionen för biokemi och biofysik
Bioinformatik (beräkningsbiologi)

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 160 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