Evidence map›Paper›PMID 34670493›Full record

ArticleBMC bioinformatics2021

Fast activation maximization for molecular sequence design.

Johannes Linder, Georg Seelig

Abstract read
In one paragraph

Article in BMC bioinformatics, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 36 papers.

0numbers the graph read from it
0cells of the map it votes in
36citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

36 citing papers in PubMed.

  1. Article
  2. Gradient-based optimization for mRNA sequence design.Bioinformatics (Oxford, England) · 2026
    Article
  3. Review
  4. Article
  5. Article
  6. Article
  7. Article
  8. Reimagining the Synthetic Biology DBTL Cycle with Machine Learning.Methods in molecular biology (Clifton, N.J.) · 2026
    Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Johannes LinderPaul G. Allen School of Computer Science and Engineering, University of Washington, Seattle, USA. jlinder2@cs.washington.edu.ORCID http://orcid.org/0000-0003-2134-7292
Georg SeeligPaul G. Allen School of Computer Science and Engineering, University of Washington, Seattle, USA.

Funding

Predictive Modeling of Alternative Splicing and Polyadenylation from Millions of Random SequencesR01HG009136 · NHGRI · UNIVERSITY OF WASHINGTON · PI SEELIG, GEORG, SHENDURE, JAY ASHOK · 2017 to 2020
$2.3M
A predictive model of mRNA stability and translation for variant interpretation and mRNA therapeuticsR01HG009892 · NHGRI · UNIVERSITY OF WASHINGTON · PI SEELIG, GEORG · 2018 to 2020
$1.4M
A massively parallel reporter assay for measuring chromatin effects on alternative splicingR21HG010945 · NHGRI · UNIVERSITY OF WASHINGTON · PI SEELIG, GEORG · 2020 to 2021
$413k
National Science Foundation 2021552NHGRI NIH HHS R01 HG009136NHGRI NIH HHS R01 HG009892NHGRI NIH HHS R21 HG010945NIH HHS R01HG009136NIH HHS R01HG009892NIH HHS R21HG010945
6 · The paper itself

Abstract

backgroundOptimization of DNA and protein sequences based on Machine Learning models is becoming a powerful tool for molecular design. Activation maximization offers a simple design strategy for differentiable models: one-hot coded sequences are first approximated by a continuous representation, which is then iteratively optimized with respect to the predictor oracle by gradient ascent. While elegant, the current version of the method suffers from vanishing gradients and may cause predictor pathologies leading to poor convergence.

resultsHere, we introduce Fast SeqProp, an improved activation maximization method that combines straight-through approximation with normalization across the parameters of the input sequence distribution. Fast SeqProp overcomes bottlenecks in earlier methods arising from input parameters becoming skewed during optimization. Compared to prior methods, Fast SeqProp results in up to 100-fold faster convergence while also finding improved fitness optima for many applications. We demonstrate Fast SeqProp's capabilities by designing DNA and protein sequences for six deep learning predictors, including a protein structure predictor.

conclusionsFast SeqProp offers a reliable and efficient method for general-purpose sequence optimization through a differentiable fitness predictor. As demonstrated on a variety of deep learning models, the method is widely applicable, and can incorporate various regularization techniques to maintain confidence in the sequence designs. As a design tool, Fast SeqProp may aid in the development of novel molecules, drug therapies and vaccines.

Indexed as

AlgorithmsMachine LearningAmino Acid SequenceActivation maximizationDeep learningDesignDNAGradient ascentNeural networkOptimizationProteinRNASequence design

Identifiers

PMID34670493
PMCPMC8527647

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.