Optimal codon randomization via mathematical programming

DOI10.1016/J.JTBI.2013.05.034zbMATH Open1397.92011OpenAlexW2105312232WikidataQ34781147 ScholiaQ34781147MaRDI QIDQ1790735FDOQ1790735

Authors: Yuval Nov, Danny Segev 

Publication date: 4 October 2018

Published in: Journal of Theoretical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jtbi.2013.05.034

Recommendations

• On the computational complexity of designing DNA randomizations in a combinatorial protein experiment
• Codon optimization by 0-1 linear programming
• Calculating complexity of large randomized libraries
• Efficient codon optimization with motif engineering
• Efficient Codon Optimization with Motif Engineering

zbMATH Keywords

integer programmingprotein engineeringcodon randomizationdegenerate oligonucleotidesspiked oligonucleotides

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Integer programming (90C10) Computational methods for problems pertaining to biology (92-08)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• COStar: A D-star Lite-based dynamic search algorithm for codon optimization
• Calculating complexity of large randomized libraries
• On the optimality of the genetic code, with the consideration of coevolution theory by comparison of prominent cost measure matrices
• On the computational complexity of designing DNA randomizations in a combinatorial protein experiment
• Codon optimization by 0-1 linear programming
• Artificial evolution. An algorithm for an exploration of the amino acid sequences space
• Efficient Codon Optimization with Motif Engineering

Uses Software

• AMPL
• GLUE-IT
• PEDEL-AA

This page was built for publication: Optimal codon randomization via mathematical programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1790735)