A Simulation-Free Topological Basis for Building Compact Koopman Models of Protein Folding
Ziad Fakhoury, Gabriele C Sosso, Scott Habershon · 2026
Read A Simulation-Free Topological Basis for Building Compact Koopman Models of Protein Folding by Ziad Fakhoury, Gabriele C Sosso, Scott Habershon (2026) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/PMC13625948.txt.
Description
Ziad Fakhoury, Gabriele C Sosso, and Scott Habershon offer a shortcut for modeling how proteins fold. The standard route runs huge molecular dynamics simulations to map a protein's shapes, then builds a Markov model that captures folding speeds and traps. Their alternative, graph-driven sampling, sketches the landscape of contact maps between the unfolded and folded states with no long simulations at all, and a shortest-hop measure sorts those sketches into states.
Applied to the WW domain, a small test protein, the graph-built model improved estimates of the folding time scale over simulation-built rivals. It also exposed kinetic traps in the landscape, dead ends that are hard to confirm by other means. Cheaper maps of folding could aid work on misfolding diseases and protein design.
Catalog record
| CREATOR | Ziad Fakhoury, Gabriele C Sosso, Scott Habershon |
|---|---|
| YEAR | 2026 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 58 KB |
| LICENSE | This article is licensed under CC-BY 4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |