HelixGAN a deep-learning methodology for conditional <i>de novo</i> design of α-helix structures
Bibliographic record
Abstract
MOTIVATION: Protein and peptide engineering has become an essential field in biomedicine with therapeutics, diagnostics and synthetic biology applications. Helices are both abundant structural feature in proteins and comprise a major portion of bioactive peptides. Precise design of helices for binding or biological activity is still a challenging problem. RESULTS: Here, we present HelixGAN, the first generative adversarial network method to generate de novo left-handed and right-handed alpha-helix structures from scratch at an atomic level. We developed a gradient-based search approach in latent space to optimize the generation of novel α-helical structures by matching the exact conformations of selected hotspot residues. The designed α-helical structures can bind specific targets or activate cellular receptors. There is a significant agreement between the helix structures generated with HelixGAN and PEP-FOLD, a well-known de novo approach for predicting peptide structures from amino acid sequences. HelixGAN outperformed RosettaDesign, and our previously developed structural similarity method to generate D-peptides matching a set of given hotspots in a known L-peptide. As proof of concept, we designed a novel D-GLP1_1 analog that matches the conformations of critical hotspots for the GLP1 function. MD simulations revealed a stable binding mode of the D-GLP1_1 analog coupled to the GLP1 receptor. This novel D-peptide analog is more stable than our previous D-GLP1 design along the MD simulations. We envision HelixGAN as a critical tool for designing novel bioactive peptides with specific properties in the early stages of drug discovery. AVAILABILITY AND IMPLEMENTATION: https://github.com/xxiexuezhi/helix_gan. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".