Codon optimization by 0-1 linear programming
From MaRDI portal
Recommendations
- Efficient codon optimization with motif engineering
- Efficient Codon Optimization with Motif Engineering
- Optimal codon randomization via mathematical programming
- Optimizing the codon usage of synthetic gene with QPSO algorithm
- COStar: A D-star Lite-based dynamic search algorithm for codon optimization
Cites work
Cited in
(10)- Optimal codon randomization via mathematical programming
- Optimizing the codon usage of synthetic gene with QPSO algorithm
- Efficient codon optimization with motif engineering
- An optimization approach to gene stacking
- Two proteins for the price of one: the design of maximally compressed coding sequences
- COStar: A D-star Lite-based dynamic search algorithm for codon optimization
- Efficient Codon Optimization with Motif Engineering
- Optimizing restriction site placement for synthetic genomes
- Combinatorial Pattern Matching
- Gene mutation estimations via mutual information and Ewens sampling based CNN & machine learning algorithms
This page was built for publication: Codon optimization by 0-1 linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2177826)