Home > Research > Publications & Outputs > Codon optimization

Links

Text available via DOI:

View graph of relations

Codon optimization: A mathematical programing approach

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Codon optimization: A mathematical programing approach. / Sen, Alper; Kargar, Kamyar; Akgün, Esma et al.
In: Bioinformatics, Vol. 36, No. 13, 01.07.2020, p. 4012-4020.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Sen, A, Kargar, K, Akgün, E & Plnar, MC 2020, 'Codon optimization: A mathematical programing approach', Bioinformatics, vol. 36, no. 13, pp. 4012-4020. https://doi.org/10.1093/bioinformatics/btaa248

APA

Sen, A., Kargar, K., Akgün, E., & Plnar, M. C. (2020). Codon optimization: A mathematical programing approach. Bioinformatics, 36(13), 4012-4020. https://doi.org/10.1093/bioinformatics/btaa248

Vancouver

Sen A, Kargar K, Akgün E, Plnar MC. Codon optimization: A mathematical programing approach. Bioinformatics. 2020 Jul 1;36(13):4012-4020. Epub 2020 Apr 20. doi: 10.1093/bioinformatics/btaa248

Author

Sen, Alper ; Kargar, Kamyar ; Akgün, Esma et al. / Codon optimization : A mathematical programing approach. In: Bioinformatics. 2020 ; Vol. 36, No. 13. pp. 4012-4020.

Bibtex

@article{0d4c0aa5ddeb4967882a924463ae9dca,
title = "Codon optimization: A mathematical programing approach",
abstract = "Motivation: Synthesizing proteins in heterologous hosts is an important tool in biotechnology. However, the genetic code is degenerate and the codon usage is biased in many organisms. Synonymous codon changes that are customized for each host organism may have a significant effect on the level of protein expression. This effect can be measured by using metrics, such as codon adaptation index, codon pair bias, relative codon bias and relative codon pair bias. Codon optimization is designing codons that improve one or more of these objectives. Currently available algorithms and software solutions either rely on heuristics without providing optimality guarantees or are very rigid in modeling different objective functions and restrictions. Results: We develop an effective mixed integer linear programing (MILP) formulation, which considers multiple objectives. Our numerical study shows that this formulation can be effectively used to generate (Pareto) optimal codon designs even for very long amino acid sequences using a standard commercial solver. We also show that one can obtain designs in the efficient frontier in reasonable solution times and incorporate other complex objectives, such as mRNA secondary structures in codon design using MILP formulations.",
author = "Alper Sen and Kamyar Kargar and Esma Akg{\"u}n and Plnar, {Mustafa C.}",
note = "Publisher Copyright: {\textcopyright} 2020 The Author(s). Published by Oxford University Press. All rights reserved.",
year = "2020",
month = jul,
day = "1",
doi = "10.1093/bioinformatics/btaa248",
language = "English",
volume = "36",
pages = "4012--4020",
journal = "Bioinformatics",
issn = "1367-4803",
publisher = "Oxford University Press",
number = "13",

}

RIS

TY - JOUR

T1 - Codon optimization

T2 - A mathematical programing approach

AU - Sen, Alper

AU - Kargar, Kamyar

AU - Akgün, Esma

AU - Plnar, Mustafa C.

N1 - Publisher Copyright: © 2020 The Author(s). Published by Oxford University Press. All rights reserved.

PY - 2020/7/1

Y1 - 2020/7/1

N2 - Motivation: Synthesizing proteins in heterologous hosts is an important tool in biotechnology. However, the genetic code is degenerate and the codon usage is biased in many organisms. Synonymous codon changes that are customized for each host organism may have a significant effect on the level of protein expression. This effect can be measured by using metrics, such as codon adaptation index, codon pair bias, relative codon bias and relative codon pair bias. Codon optimization is designing codons that improve one or more of these objectives. Currently available algorithms and software solutions either rely on heuristics without providing optimality guarantees or are very rigid in modeling different objective functions and restrictions. Results: We develop an effective mixed integer linear programing (MILP) formulation, which considers multiple objectives. Our numerical study shows that this formulation can be effectively used to generate (Pareto) optimal codon designs even for very long amino acid sequences using a standard commercial solver. We also show that one can obtain designs in the efficient frontier in reasonable solution times and incorporate other complex objectives, such as mRNA secondary structures in codon design using MILP formulations.

AB - Motivation: Synthesizing proteins in heterologous hosts is an important tool in biotechnology. However, the genetic code is degenerate and the codon usage is biased in many organisms. Synonymous codon changes that are customized for each host organism may have a significant effect on the level of protein expression. This effect can be measured by using metrics, such as codon adaptation index, codon pair bias, relative codon bias and relative codon pair bias. Codon optimization is designing codons that improve one or more of these objectives. Currently available algorithms and software solutions either rely on heuristics without providing optimality guarantees or are very rigid in modeling different objective functions and restrictions. Results: We develop an effective mixed integer linear programing (MILP) formulation, which considers multiple objectives. Our numerical study shows that this formulation can be effectively used to generate (Pareto) optimal codon designs even for very long amino acid sequences using a standard commercial solver. We also show that one can obtain designs in the efficient frontier in reasonable solution times and incorporate other complex objectives, such as mRNA secondary structures in codon design using MILP formulations.

U2 - 10.1093/bioinformatics/btaa248

DO - 10.1093/bioinformatics/btaa248

M3 - Journal article

C2 - 32311016

AN - SCOPUS:85087528639

VL - 36

SP - 4012

EP - 4020

JO - Bioinformatics

JF - Bioinformatics

SN - 1367-4803

IS - 13

ER -