mRNA codon optimization on quantum computers
Fox, D. M.; Branson, K. M.; Walker, R. C.
Show abstract
Reverse translation of polypeptide sequences to expressible mRNA constructs is a NP-hard combinatorial optimization problem. Each amino acid in the protein sequence can be represented by as many as six codons, and the process of selecting the combination that maximizes probability of expression is termed codon optimization. This work investigates the potential impact of leveraging quantum computing technology for codon optimization. An adiabatic quantum computer (AQC) is compared to a standard genetic algorithm (GA) programmed with the same objective function. The AQC is found to be competitive in identifying optimal solutions and future generations of AQCs may be able to outperform classical GAs. The utility of gate-based systems is also evaluated using a simulator resulting in the finding that while current generations of devices lack the hardware requirements, in terms of both qubit count and connectivity, to solve realistic problems, future generation devices may be highly efficient.
Matching journals
The top 4 journals account for 50% of the predicted probability mass.
Similar papers in this journal
- Multi-Scale Coarse Grained Model for the Stepping of Molecular Motors with application to Kinesin. 96%
- Kinetic Diagram Analysis: A Python Library for Calculating Steady-State Observables of Biochemical Systems Analytically 95%
- Multiscale Responsive Kinetic Modeling: Quantifying Biomolecular Reaction Flux under Varying Electrochemical Conditions 94%
Similar papers in this journal
- Insights from Incorporating Quantum Computing into Drug Design Workflows 96%
- IsoMaTrix: a framework to visualize the isoclines of matrix games and quantify uncertainty in structured populations 93%
- Quasi-Entropy Closure: A Fast and Reliable Approach to Close the Moment Equations of the Chemical Master Equation 93%
Similar papers in this journal
"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.