Folding–unfolding asymmetry and a RetroFold computational algorithm

We treat protein folding as molecular self-assembly, while unfolding is viewed as disassembly. Fracture is typically a much faster process than self-assembly. Self-assembly is often an exponentially decaying process, since energy relaxes due to dissipation, while fracture is a constant-rate process...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Royal Society open science Ročník 10; číslo 5; s. 221594
Hlavní autoři: Shityakov, Sergey, Skorb, Ekaterina V., Nosonovsky, Michael
Médium: Journal Article
Jazyk:angličtina
Vydáno: England The Royal Society 03.05.2023
Témata:
Biochemistry, Cellular and Molecular Biology
folding
molecular dynamics
RetroFold algorithm
Trp-cage
unfolding
RetroFold algorithm
molecular dynamics
unfolding
Trp-cage
folding
ISSN:2054-5703, 2054-5703
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We treat protein folding as molecular self-assembly, while unfolding is viewed as disassembly. Fracture is typically a much faster process than self-assembly. Self-assembly is often an exponentially decaying process, since energy relaxes due to dissipation, while fracture is a constant-rate process as the driving force is opposed by damping. Protein folding takes two orders of magnitude longer than unfolding. We suggest a mathematical transformation of variables, which makes it possible to view self-assembly as time-reversed disassembly, thus folding can be studied as reversed unfolding. We investigate the molecular dynamics modelling of folding and unfolding of the short Trp-cage protein. Folding time constitutes about 800 ns, while unfolding (denaturation) takes only about 5.0 ns and, therefore, fewer computational resources are needed for its simulation. This RetroFold approach can be used for the design of a novel computation algorithm, which, while approximate, is less time-consuming than traditional folding algorithms.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:2054-5703
2054-5703
DOI:10.1098/rsos.221594